Minimum distance bounds for cyclic codes and Deligne's theorem

At the present time, there are very good methods to obtain bounds for the minimum distance of BCH codes and their duals. On the other hand, there are few other bounds suitable for general cyclic codes. Therefore, research Problem 9.9 of MacWilliams and Sloane (1977), The Theory of Error-Correcting Codes, asks if the bound of Deligne (1974) for exponential sums in several variables or the bound of Lang and Weil (1954), can be used to obtain bounds on the minimum distance of codes. This question is answered in the affirmative by showing how Deligne's theorem can be made to yield a lower bound on the minimum distance of certain classes of cyclic codes. In the process, an infinite family of binary cyclic codes is presented for which the bound on minimum distance so derived is as tight as possible. In addition, an infinite family of polynomials of degree 3 in 2 variables over a field of characteristic 2, for which Deligne's bound is tight, is exhibited. Finally, a bound is presented for the minimum distance of the duals of the binary subfield subcodes of generalized Reed-Muller codes as well as for the corresponding cyclic codes. It is noted that these codes contain examples of the best binary cyclic codes. >

[1]  A. Weil.  Numbers of solutions of equations in finite fields , 1949 .

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

[3]  Jacques Wolfmann,et al.  New bounds on cyclic codes from algebraic curves , 1988, Coding Theory and Applications.

[4]  Jean-Pierre Serre,et al.  Nombres de points des courbes algébriques sur F ... , 1983 .

[5]  Jean-Marie Goethals,et al.  On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

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

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

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

[9]  Oscar Moreno,et al.  Exponential sums and Goppa codes. I , 1991 .

[10]  G. Lachaud,et al.  The weights of the orthogonals of the extended quadratic binary Goppa codes , 1990, IEEE Trans. Inf. Theory.

[11]  P. Deligne.  La conjecture de Weil. I , 1974 .

[12]  Enrico Bombieri,et al.  ON TWO PROBLEMS OF MORDELL. , 1966 .

[13]  Enrico Bombieri,et al.  On Exponential Sums in Finite Fields , 1966 .

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

[15]  Carlos J. Moreno,et al.  Algebraic curves over finite fields: Frontmatter , 1991 .

[16]  Tor Helleseth,et al.  On the covering radius of cyclic linear codes and arithmetic codes , 1985, Discret. Appl. Math..

[17]  O. Moreno,et al.  The Macwilliams-Sloane Conjecture on the Tightness of the Carlitz-Uchiyama Bound and the Weights of Duals of Bch Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[18]  Steven Sperber,et al.  Exponential sums and Newton polyhedra: Cohomology and estimates , 1989 .

[19]  Gérard D. Cohen,et al.  Linear intersecting codes , 1985, Discret. Math..

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

[21]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[22]  Oscar Moreno,et al.  Exponential sums and Goppa codes: II , 1989, IEEE Trans. Inf. Theory.

[23]  S. Lang,et al.  NUMBER OF POINTS OF VARIETIES IN FINITE FIELDS. , 1954 .

[24]  Steven Sperber,et al.  Exponential sums and Newton polyhedra , 1987 .

[25]  A. Tietavainen,et al.  An asymptotic bound on the covering radii of binary BCH codes , 1990 .

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

[27]  A. Tietäväinen,et al.  On the covering radius of long binary BCH codes , 1987 .