English
Related papers

Related papers: Two classes of LCD BCH codes over finite fields

200 papers

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…

Information Theory · Computer Science 2012-09-03 Alexander Zeh , Sergey Bezzateev

Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first…

Information Theory · Computer Science 2013-09-06 Nian Li , Chunlei Li , Tor Helleseth , Cunsheng Ding , Xiaohu Tang

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a…

Information Theory · Computer Science 2026-04-29 Yaqi Chen , Hao Chen , Cunsheng Ding , Huimin Lao

Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…

Information Theory · Computer Science 2024-04-30 Tingfang Chen , Zhonghua Sun , Conghui Xie , Hao Chen , Cunsheng Ding

Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best parameters known. They are divided into simple-root cyclic codes and…

Information Theory · Computer Science 2024-05-24 Hao Chen , Conghui Xie , Cunsheng Ding

In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…

Information Theory · Computer Science 2024-02-08 José Joaquín Bernal , Diana H. Bueno-Carreño , Juan Jacobo Simón

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…

Information Theory · Computer Science 2025-04-17 Xiaoqiang Wang , Liuyi Li , Yansheng Wu , Dabin Zheng , Shuxian Lu

In this paper we comprehensively investigate block-wise product (BWP) BCH codes, wherein raw data is arranged in the form of block-wise matrix and each row and column BCH codes intersect on one data block. We first devise efficient BCH…

Information Theory · Computer Science 2018-12-19 Yingquan Wu , Eyal En Gad

We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS…

Quantum Physics · Physics 2016-01-25 Markus Grassl , Martin Roetteler

Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary dual (LCD) codes are useful in fault injections attacks on…

Information Theory · Computer Science 2020-11-09 Charul Rajput , Maheshanand Bhaintwal , Ramakrishna Bandi

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be…

Information Theory · Computer Science 2022-08-31 Gaofei Wu , Huan Liu , Yuqing Zhang

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\mathcal{A}^n$, such that the Hamming distance between two…

Combinatorics · Mathematics 2015-04-28 Janne I. Kokkala , Patric R. J. Östergård

Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…

Information Theory · Computer Science 2019-09-17 Mehmet E. Koroglu , Mustafa Sarı

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…

Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…

Information Theory · Computer Science 2017-09-12 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

In recent years, polar codes have been considered for communication systems that require high re-liability and ultra-low latency, such as sixth generation (6G) wireless communications. This paper presents simulation results showing that…

Information Theory · Computer Science 2025-01-15 Robert Morelos-Zaragoza , Jeffrey Ma

Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…

Information Theory · Computer Science 2023-02-14 Shitao Li , Minjia Shi , Huizhou Liu

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…

Information Theory · Computer Science 2015-11-24 Pengfei Huang , Eitan Yaakobi , Hironori Uchikawa , Paul H. Siegel