Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1995: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 341–346Cite as

On the covering radius of long Goppa codes

  • Submitted Contributions
  • Conference paper
  • First Online:

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

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. G. D. COHEN, M. G. KARPOVSKY, H. F. MATTSON, Jr., and J. R. SCHATZ: Covering radius —survey and recent results, IEEE Trans. Inform. Theory, vol. IT-31, pp. 328–343, 1985.

    Google Scholar 

  2. G. D. COHEN, S. N. LITSYN, A. C. LOBSTEIN and H. F. MATTSON, Jr.: Covering radius 1985–1994, submitted.

    Google Scholar 

  3. T. HELLESETH: On the covering radius of cyclic linear codes and arithmetic codes, Discrete Applied Mathematics, vol. 11, pp. 157–173, 1985.

    Google Scholar 

  4. C. J. MORENO and O. MORENO: Exponential sums and Goppa codes I, Proc. American Math. Soc., vol. 111, pp. 523–531, 1991.

    Google Scholar 

  5. C. J. MORENO and O. MORENO: Exponential sums and Goppa codes II, IEEE Transactions of Information Theory, vol. 3, No.4, pp.1222–1229, 1992.

    Google Scholar 

  6. T. J. RIVLIN: Chebyshev polynomials. From appoximation Theory to Algebra and Number Theory. Wiley and Sons, 1992.

    Google Scholar 

  7. A. TIETÄVÄINEN: On the covering radius of long binary BCH codes, Discrete Applied Mathematics, vol. 16, pp. 75–77, 1987.

    Google Scholar 

  8. S. G. VLÄDUTS and A. N. SKOROBOGATOV: Covering radius for long BCH codes, Problemy Peredachi Informatsii, vol. 25, pp. 38–45, 1989. Translated in: Problems of Inform. Transm., vol. 25, No. 1, pp. 28–34, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Domaine de Voluceau, Institut National de Recherche en Informatique et Automatique (INRIA), Rocquencourt, B.P.105, 78153, Le Chesnay Cedex, France

    Françoise Levy-dit-Vehel

  2. Dept. of Electrical Engineering-Systems, Tel Aviv University, P.O.B 39040, 69978, Ramat Aviv, Tel Aviv, Israel

    Simon Litsyn

Authors
  1. Françoise Levy-dit-Vehel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Litsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Marc Giusti Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levy-dit-Vehel, F., Litsyn, S. (1995). On the covering radius of long Goppa codes. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-60114-7_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60114-2

  • Online ISBN: 978-3-540-49440-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation