The dimension and minimum distance of two classes of primitive BCH codes
From MaRDI portal
Publication:2396760
DOI10.1016/J.FFA.2016.12.009zbMATH Open1402.94100arXiv1603.07007OpenAlexW2304375173MaRDI QIDQ2396760FDOQ2396760
Authors: Cunsheng Ding, Zhengchun Zhou, Cui Ling Fan
Publication date: 24 May 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1603.07007
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
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The weight distribution of a class of \(p\)-ary cyclic codes
- Secret sharing schemes from three classes of linear codes
- Title not available (Why is that?)
- Fundamentals of Error-Correcting Codes
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Further evaluations of Weil sums
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Title not available (Why is that?)
- How to build robust shared control systems
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Nonbinary Kasami sequences over GF(p)
- Title not available (Why is that?)
- The Bose and Minimum Distance of a Class of BCH Codes
- Generalized modified Gold sequences
- The Enumeration of Information Symbols in BCH Codes
- A Class of Nonbinary Codes and Sequence Families
- Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes
- Parameters of Several Classes of BCH Codes
- On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes
- On a class of primitive BCH-codes
- On the number of information symbols in Bose-Chaudhuri codes
- Studying the locator polynomials of minimum weight codewords of BCH codes
- Idempotents and the BCH bound
- The weight distributions of extended binary primitive BCH codes of length 128
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- Title not available (Why is that?)
- Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not
- Title not available (Why is that?)
Cited In (50)
- More results on hulls of some primitive binary and ternary BCH codes
- New quantum codes derived from a family of antiprimitive BCH codes
- A class of primitive BCH codes and their weight distribution
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- 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
- Three classes of BCH codes and their duals
- On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
- 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
- Infinite families of 2-designs and 3-designs from linear codes
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Binary primitive LCD BCH codes
- Explicit characterization of two classes of regular bent functions
- Some binary BCH codes with length \(n = 2^m + 1\)
- A class of constacyclic BCH codes
- Five families of the narrow-sense primitive BCH codes over finite fields
- A class of constacyclic BCH codes with length \(\frac{q^m + 1}{2} \)
- 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} \)
- Infinite families of 3-designs from a type of five-weight code
- Quantum BCH codes with maximum designed distance
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Title not available (Why is that?)
- Several classes of bent functions over finite fields
- New classes of bent functions via the switching method
- Some constacyclic BCH codes with good parameters
- Title not available (Why is that?)
- Parameters of LCD BCH codes with two lengths
- Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
- The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
- BCH cyclic codes
- A class of negacyclic BCH codes and its application to quantum codes
- Ternary primitive LCD BCH codes
- Parameters and characterizations of hulls of some projective narrow-sense BCH codes
- Dimensions of nonbinary antiprimitive BCH codes and some conjectures
- Several infinite families of \(p\)-ary weakly regular bent functions
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
- Two families of negacyclic BCH codes
- Parameters of hulls of primitive binary narrow-sense BCH codes and their subcodes
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- Some new results on dimension and Bose distance for various classes of BCH codes
- BCH Codes with Minimum Distance Proportional to Code Length
- The dimension of BCH codes
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- The maximum designed distances of dual-containing non-primitive BCH codes
- Parameters of 2-Designs from Some BCH Codes
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)
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)