English
Related papers

Related papers: BCH codes over $\gf(q)$ with length $q^m+1$

200 papers

Despite the theoretical and practical significance of BCH codes, the exact minimum distance and dimension remain unknown for many families. This paper establishes the precise minimum distance and dimension of narrow-sense BCH codes $\C_{(q,…

Information Theory · Computer Science 2025-07-22 Zhonghua Sun

Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes -- a family of cyclic codes -- in practice. In theory, BCH…

Information Theory · Computer Science 2016-03-24 Cunsheng Ding , Cuiling Fan , Zhengchun Zhou

In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo…

Information Theory · Computer Science 2021-01-21 Shixin Zhu , Binbin Pang , Zhonghua Sun

An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this…

Quantum Physics · Physics 2007-07-13 Salah Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Information Theory · Computer Science 2021-01-22 Xiaoqiang Wang , Dabin Zheng , Cunsheng Ding

Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension $3$ and $4$ were studied and distance-optimal subfield codes over $\gf(p)$ were obtained, where $q=p^m$. The key idea for obtaining very good…

Information Theory · Computer Science 2020-08-11 Ziling Heng , Cunsheng Ding

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

BCH codes form an important class of cyclic codes, which have applications in communication and data storage systems. Although the BCH bound provides a lower bound on the minimum distance of BCH codes, determining the true minimum distances…

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

Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…

Information Theory · Computer Science 2023-02-28 Hai Liu , Chengju Li , Haifeng Qian

In this paper, we study a family of constacyclic BCH codes over $\mathbb{F}_{q^2}$ of length $n=\frac{q^{2m}-1}{q+1}$, where $q$ is a prime power, and $m\geq2$ an even integer. The maximum design distance of narrow-sense Hermitian…

Information Theory · Computer Science 2020-07-28 X. Zhao , X. Li , Q. Wang , T. Yan

In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…

Information Theory · Computer Science 2023-12-20 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Information Theory · Computer Science 2015-10-20 Cuiling Fan , Nian Li , Zhengchun Zhou

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

Information Theory · Computer Science 2024-04-30 Tingting Wu , Lanqiang Li , Xiuyu Zhang , Shixin Zhu

In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…

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

Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades. Even for the…

Information Theory · Computer Science 2017-11-06 Shuxing Li

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…

Information Theory · Computer Science 2020-03-26 Martino Borello , Abdelillah Jamous

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code…

Quantum Physics · Physics 2025-05-12 Olai Å. Mostad , Hsuan-Yin Lin , Eirik Rosnes , De-Shih Lee , Ching-Yi Lai