The Minimum Distance of Some Narrow-Sense Primitive BCH Codes

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 narrow-sense primitive BCH codes, which form the most well-studied subclass of BCH codes, there are very few theoretical results on the minimum distance. In this paper, we present new results on the minimum distance of narrow-sense primitive BCH codes with special Bose distance. We prove that for a prime power $q$, the $q$-ary narrow-sense primitive BCH code with length $q^m-1$ and Bose distance $q^m-q^{m-1}-q^i-1$, where $\frac{m-2}{2} \le i \le m-\lfloor \frac{m}{3} \rfloor-1$, has minimum distance $q^m-q^{m-1}-q^i-1$. This is achieved by employing the beautiful theory of sets of quadratic forms, symmetric bilinear forms and alternating bilinear forms over finite fields, which can be best described using the framework of association schemes.

[1]  Elwyn R. Berlekamp.  The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller Codes , 1970, Inf. Control..

[2]  Keqin Feng,et al.  On the Weight Distributions of Two Classes of Cyclic Codes , 2008, IEEE Transactions on Information Theory.

[3]  Cunsheng Ding,et al.  Parameters of Several Classes of BCH Codes , 2015, IEEE Transactions on Information Theory.

[4]  Tadao Kasami,et al.  Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes , 1969, IEEE Trans. Inf. Theory.

[5]  Kai-Uwe Schmidt,et al.  Symmetric bilinear forms over finite fields of even characteristic , 2010, J. Comb. Theory A.

[6]  C. Ding.  Codes From Difference Sets , 2014 .

[7]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

[8]  Tadao Kasami,et al.  The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes , 1971, Inf. Control..

[9]  Cunsheng Ding,et al.  The dimension and minimum distance of two classes of primitive BCH codes , 2016, Finite Fields Their Appl..

[10]  Tadao Kasami,et al.  Some results on the minimum weight of primitive BCH codes (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[11]  Pascale Charpin,et al.  Open problems on cyclic codes , 2009 .

[12]  Cunsheng Ding,et al.  Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$ , 2016, IEEE Transactions on Information Theory.

[13]  Pradeep Kiran Sarvepalli,et al.  On Quantum and Classical BCH Codes , 2006, IEEE Transactions on Information Theory.

[14]  Henry B. Mann,et al.  On the Number of Information Symbols in Bose-Chaudhuri Codes , 1962, Inf. Control..

[15]  Elwyn R. Berlekamp.  The enumeration of information symbols in BCH codes , 1967 .

[16]  S. Chowla,et al.  On Difference Sets. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[17]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[18]  Yangxian Wang,et al.  Association Schemes of Quadratic Forms and Symmetric Bilinear Forms , 2003 .

[19]  Philippe Delsarte,et al.  On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[20]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[21]  Kai-Uwe Schmidt,et al.  Symmetric bilinear forms over finite fields with applications to coding theory , 2014, Journal of Algebraic Combinatorics.

[22]  Susanne Ebersbach,et al.  Designs And Their Codes , 2016 .

[23]  Anne Canteaut,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[24]  Rongquan Feng,et al.  Eigenvalues of association schemes of quadratic forms , 2008, Discret. Math..

[25]  Siu Lun Ma,et al.  A survey of partial difference sets , 1994, Des. Codes Cryptogr..

[26]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[27]  Pascale Charpin.  On a class of primitive BCH-codes , 1990, IEEE Trans. Inf. Theory.

[28]  Gérard D. Cohen.  On the minimum distance of some BCH codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[29]  Pascale Charpin,et al.  Studying the locator polynomials of minimum weight codewords of BCH codes , 1992, IEEE Trans. Inf. Theory.

[30]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[31]  Daniel Augot,et al.  Idempotents and the BCH bound , 1994, IEEE Trans. Inf. Theory.

[32]  Cunsheng Ding,et al.  The Bose and Minimum Distance of a Class of BCH Codes , 2015, IEEE Transactions on Information Theory.

[33]  P. Delsarte.  AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[34]  Dian-Wu Yue,et al.  Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes , 2000, IEEE Trans. Inf. Theory.

[35]  T. Kasami.  WEIGHT DISTRIBUTION OF BOSE-CHAUDHURI-HOCQUENGHEM CODES. , 1966 .

[36]  Jean-Marie Goethals,et al.  Alternating Bilinear Forms over GF(q) , 1975, J. Comb. Theory A.