Skip to main content

Families of codes exceeding the Varshamov-Gilbert bound

  • Section I Coding And Algebraic Geometry
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 388))

Abstract

The number A(q) is the superior limit of the maximum number of points of an algebraic curve defined over the finite field with q elements, divided by the genus. It has been shown by J.-P. Serre that A(q)≥c logq, where c is a positive constant. His method, based on the existence of infinite towers of Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some new values of q for which there exists families of codes defined over Fq, exceeding the Varshamov-Gilbert bound.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lachaud, G.: "Les codes géométriques de Goppa", Séminaire Bourbaki, 1984–85, exposé no 641, Astérisque 133–134, 1986.

    Google Scholar 

  2. Manin, Yu, I.: "What is the maximum number of points of a curve over F2 ?", J. Fac. Sci. Tokyo, I., A., 28, 1981, p. 715–720.

    Google Scholar 

  3. Manin, Vladut: "Linear codes and modular curves", English translation in J.of Soviet Maths, Vol. 30, no 6, p. 2611–2643.

    Google Scholar 

  4. Michon, J.F.: "Geométrie algébrique et codes", p. 301–318 in poli, A., Huguet, Li., Codes Correcteurs, Paris Masson, 1989.

    Google Scholar 

  5. Perret, M.: "Sur le nombre de points d'une courbe sur un corps fini — Application aux codes correcteurs d'erreurs", C.R. Acad. Sci. Paris, à paraître.

    Google Scholar 

  6. Tsfasman, M.A.: "Goppa codes that are better than the Varshamov-Gilbert bound", Prob-Peredatchi Inform, 18, 1982, p. 3–6, Traduction anglaise: Prob. Inform. Trans., 18, 1982, p. 163–166.

    Google Scholar 

  7. Tsfasman, Vladut & Zink: "Modular curves, Shimura curves, and Goppa codes that are better than the Varshamov-Gilbert bound", Math-Nachr, 109, 1982, p. 163–166.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perret, M. (1989). Families of codes exceeding the Varshamov-Gilbert bound. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019844

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51643-9

  • Online ISBN: 978-3-540-46726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics