Skip to main content
Log in

Abstract

A lower bound for the dimension of geometric BCH codes (i.e. subfield subcodes of Goppa codes) has been given by M. Wirtz [7]. We prove that this bound is actually exact for “small” enough divisorG.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Goppa, V. D.: Geometry and codes. Dordrecht: Kluwer Academic 1989

    Google Scholar 

  2. Lachaud, G.: Les codes géométriques de Goppa, Séminaire Bourbaki 1984/85, exp. n°641. Astérisque, Vol. 133–134, 189–207 (1986)

    Google Scholar 

  3. Lachaud, G.: Artin-Schreier Curves, Exponential sums, and the Carlitz-Uchiyama bound for Geometric Codes. J. Number Theory39(1), 18–40 (1991)

    Google Scholar 

  4. MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes. Amsterdam: North-Holland 1977

    Google Scholar 

  5. Moreno, C. J., Moreno, O.: Exponential sums and Goppa codes: IV, preprint (1989)

  6. Skorobogatov, A. N.: Subcodes of algebraic-geometric codes over prime fields, preprint (1989)

  7. Wirtz, M.: On the Parameters of Goppa Codes. IEEE Trans. Inform. Theory34 (5), 1341–1343 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rodier, F. On the dimension of Goppa codes. AAECC 3, 263–267 (1992). https://doi.org/10.1007/BF01294836

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01294836

Keywords

Navigation