On the Distance Distribution of Duals of BCH Codes

We derive upper bounds on the components of the distance distribution of duals of BCH codes. Roughly speaking, these bounds show that the distance distribution can be upper-bounded by the corresponding normal distribution. To derive the bounds we use the linear programming approach along with some estimates on the magnitude of Krawtchouk polynomials of fixed degree in a vicinity of q/2.

[1]  Robert J. McEliece,et al.  Weights of cyclic codes , 1966 .

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  L. Carlitz,et al.  Bounds for exponential sums , 1957 .

[4]  Robert J. McEliece,et al.  Weight congruences for p-ary cyclic codes , 1972, Discret. Math..

[5]  A. Weil.  On Some Exponential Sums. , 1948, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Paul H. Siegel,et al.  Distance-enhancing codes for digital recording , 1998 .

[7]  Oscar Moreno,et al.  The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes , 1994, IEEE Trans. Inf. Theory.

[8]  G. Lachaud.  Artin-Schreier curves, exponential sums, and the Carlitz-Uchiyama bound for geometric codes , 1991 .

[9]  James Ax,et al.  ZEROES OF POLYNOMIALS OVER FINITE FIELDS. , 1964 .

[10]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[11]  Oscar Moreno,et al.  An improved Bombieri-Weil bound and applications to coding theory , 1992 .

[12]  Simon Litsyn,et al.  On Integral Zeros of Krawtchouk Polynomials , 1996, J. Comb. Theory, Ser. A.

[13]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[14]  D. Anderson.  A New Class of Cyclic Codes , 1968 .

[15]  Vladimir I. Levenshtein,et al.  Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.

[16]  Brian H. Marcus,et al.  Finite-State Modulation Codes for Data Storage , 2004 .