Exponential sums and Goppa codes. I

A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new bound is used to estimate the covering radius of long binary Goppa codes. A new lower bound is also derived on the minimum distance of the dual of a binary Goppa code, similar to that for BCH codes. This is an example of the use of a number-theory bound for the problem of the estimation of minimum distance of codes, as posed in research problem 9.9 of Mac Williams and Sloane, The Theory of Error Correcting Codes.

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

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

[3]  F. Torres,et al.  Algebraic Curves over Finite Fields , 1991 .

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

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

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

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

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