English
Related papers

Related papers: Dimensions of nonbinary antiprimitive BCH codes an…

200 papers

It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite…

Information Theory · Computer Science 2021-09-29 Hongwei Zhu , Minjia Shi , Xiaoqiang Wang , Tor Helleseth

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

Affine-invariant codes have attracted considerable attention due to their rich algebraic structure and strong theoretical properties. In this paper, we study a family of affine-invariant codes whose defining set consists of all descendants…

Information Theory · Computer Science 2026-04-01 Xiongkun Zheng , Dabin Zheng , Xiaoqiang Wang , Mu Yuan

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

The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, the minimum distance and the weight distribution of the BCH code. We construct…

Information Theory · Computer Science 2022-06-23 Martin Bossert , Rebekka Schulz , Sebastian Bitzer

BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In many cases, BCH codes are the best linear codes. However, the dimension and minimum distance of BCH codes have been seldom…

Information Theory · Computer Science 2021-12-07 Xiaoqiang Wang

BCH codes are an important class of cyclic codes, and have wide applicantions in communication and storage systems. However, it is difficult to determine the parameters of BCH codes and only a few cases are known. In this paper, we mainly…

Information Theory · Computer Science 2022-12-07 Yanhui Zhang

BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of…

Information Theory · Computer Science 2023-12-12 Xiaoqiang Wang , Chengliang Xiao , Dabin Zheng

Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem (BCH) codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum…

Quantum Physics · Physics 2016-11-17 Giuliano G. La Guardia

Historically, LCD cyclic codes were referred to as reversible cyclic codes, which had application in data storage. Due to a newly discovered application in cryptography, there has been renewed interest on LCD codes. In this paper, we…

Information Theory · Computer Science 2017-02-22 Shuxing Li , Chengju Li , Cunsheng Ding , Hao Liu

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

Classical BCH codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its…

Quantum Physics · Physics 2007-05-23 Salah A. Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

Let $\mathcal{C}_{(q,q^m+1,3,h)}$ denote the antiprimitive BCH code with designed distance 3. In this paper, we demonstrate that the minimum distance $d$ of $\mathcal{C}_{(q,q^m+1,3,h)}$ equals 3 if and only if $\gcd(2h+1,q+1,q^m+1)\ne1$.…

Information Theory · Computer Science 2025-05-08 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length…

Information Theory · Computer Science 2023-09-06 Yanhui Zhang , Li Liu , Xianhong Xie

Discovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being…

Information Theory · Computer Science 2008-12-18 Carl Bracken

Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and the other directly…

Information Theory · Computer Science 2008-02-28 Salah A. Aly

This paper is devoted to studying two main problems: 1) computing the apparent distance of an Abelian code and 2) giving a notion of Bose, Ray-Chaudhuri, Hocquenghem (BCH) multivariate code. To do this, we first strengthen the notion of an…

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

Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most…

Information Theory · Computer Science 2016-11-02 Shuxing Li , Cunsheng Ding , Maosheng Xiong , Gennian Ge

New properties of $q$-ary cyclotomic cosets modulo $n = q^{m} - 1$, where $q \geq 3$ is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of…

Information Theory · Computer Science 2016-01-01 Giuliano Gadioli La Guardia , Marcelo Muniz Silva Alves

The binary primitive triple-error-correcting BCH code is a cyclic code of minimum distance 7 with generator polynomial having zeros $\alpha$, $\alpha^3$ and $\alpha^5$ where $\alpha$ is a primitive root of unity. The zero set of the code is…

Information Theory · Computer Science 2009-01-14 Carl Bracken , Tor Helleseth