The dimension and minimum distance of two classes of primitive BCH codes
From MaRDI portal
Publication:2396760
Abstract: 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 codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, the dimension and minimum distance of these codes are not known in general. The objective of this paper is to determine the dimension and minimum distances of two classes of narrow-sense primitive BCH codes with design distances and . The weight distributions of some of these BCH codes are also reported. As will be seen, the two classes of BCH codes are sometimes optimal and sometimes among the best linear codes known.
Recommendations
- BCH codes with minimum distance proportional to code length
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- A class of primitive BCH codes and their weight distribution
- Some new results on dimension and Bose distance for various classes of BCH codes
- The minimum distance of some narrow-sense primitive BCH codes
Cites work
- A Class of Nonbinary Codes and Sequence Families
- Fundamentals of Error-Correcting Codes
- Further evaluations of Weil sums
- Generalized modified Gold sequences
- How to build robust shared control systems
- scientific article; zbMATH DE number 3663008 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 1284424 (Why is no real title available?)
- scientific article; zbMATH DE number 3335651 (Why is no real title available?)
- scientific article; zbMATH DE number 3394018 (Why is no real title available?)
- Idempotents and the BCH bound
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes
- Nonbinary Kasami sequences over GF(p)
- On a class of primitive BCH-codes
- On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the number of information symbols in Bose-Chaudhuri codes
- Parameters of Several Classes of BCH Codes
- Secret sharing schemes from three classes of linear codes
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- Studying the locator polynomials of minimum weight codewords of BCH codes
- The Bose and Minimum Distance of a Class of BCH Codes
- The Enumeration of Information Symbols in BCH Codes
- The weight distribution of a class of p-ary cyclic codes
- The weight distribution of a class of linear codes from perfect nonlinear functions
- The weight distributions of extended binary primitive BCH codes of length 128
- Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not
Cited in
(68)- Explicit characterization of two classes of regular bent functions
- Some binary BCH codes with length \(n = 2^m + 1\)
- A class of negacyclic BCH codes and its application to quantum codes
- Several infinite families of \(p\)-ary weakly regular bent functions
- Parameters of LCD BCH codes with two lengths
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)
- Infinite families of 2-designs and 3-designs from linear codes
- Parameters and characterizations of hulls of some projective narrow-sense BCH codes
- Quantum BCH codes with maximum designed distance
- A class of constacyclic BCH codes
- Some new results on dimension and Bose distance for various classes of BCH codes
- Binary primitive LCD BCH codes
- Five families of the narrow-sense primitive BCH codes over finite fields
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Infinite families of 3-designs from a type of five-weight code
- More results on hulls of some primitive binary and ternary BCH codes
- Several classes of bent functions over finite fields
- scientific article; zbMATH DE number 139937 (Why is no real title available?)
- The minimum distance of some narrow-sense primitive BCH codes
- New quantum codes derived from a family of antiprimitive BCH codes
- BCH codes with minimum distance proportional to code length
- scientific article; zbMATH DE number 975392 (Why is no real title available?)
- On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
- Parameters of 2-designs from some BCH codes
- Dimensions of nonbinary antiprimitive BCH codes and some conjectures
- Three classes of BCH codes and their duals
- Two families of negacyclic BCH codes
- Parameters of hulls of primitive binary narrow-sense BCH codes and their subcodes
- Ternary primitive LCD BCH codes
- The maximum designed distances of dual-containing non-primitive BCH codes
- New classes of bent functions via the switching method
- BCH cyclic codes
- Complete classification of Hadamard products of codimension 1 subcodes of Reed-Muller codes
- On Bose distance of a class of BCH codes with two types of designed distances
- Some results on the dimension and Bose distance of the antiprimitive BCH codes
- Minimal linear codes constructed from partial spreads
- On binary LCD BCH codes of length \(\frac{2^m + 1}{3}\)
- On the parameters of some LCD BCH codes over \(\mathbb{F}_q\) with length \((q^m+1)/\lambda\)
- A class of BCH codes of length \(\frac{ 2 ( q^{2 m} - 1 )}{ q + 1}\) and their duals
- Parameters of some BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m - 1}{2} \)
- Some results on BCH codes of length \(\frac{q^m + 1}{2} \)
- A class of constacyclic BCH codes with length \(\frac{q^m + 1}{2} \)
- Some constacyclic BCH codes with good parameters
- Combinatorial t-designs and strongly regular graphs from projective codes over finite fields
- A class of primitive BCH codes and their weight distribution
- The idempotent of a class of p-ary BCH codes
- Constructions of LCD codes from their Schur products
- BCH codes with explicit minimum distance and applications in quantum synchronizable codes
- A class of negacyclic BCH codes and its dual
- Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
- Negacyclic dually-BCH codes of length q^m -1
- A class of BCH codes with length \(\frac{q^{2m}-1}{q+1}\)
- Several families of negacyclic BCH codes and their duals
- Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
- Several classes of BCH and negacyclic BCH codes of length \(n = \frac{q^m -1}{2}\)
- On the minimum distance of a class of binary BCH codes
- On the parameters of a class of narrow sense primitive BCH codes
- A class of BCH codes of length \(n = \frac{q^m -1}{4}\)
- Two classes of q-ary constacyclic BCH codes
- A class of ternary LCD cyclic codes
- A family of cyclic codes with increasing dimensions and fixed minimum distances
- A class of narrow-sense BCH codes of length \(\frac{ q^m - 1}{ \lambda} \)
- The dimension of BCH codes
This page was built for publication: The dimension and minimum distance of two classes of primitive BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396760)