Advertisement

On the covering radius of long Goppa codes

  • Françoise Levy-dit-Vehel
  • Simon Litsyn
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 948)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    G. D. COHEN, S. N. LITSYN, A. C. LOBSTEIN and H. F. MATTSON, Jr.: Covering radius 1985–1994, submitted.Google Scholar
  3. 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. 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. 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. 6.
    T. J. RIVLIN: Chebyshev polynomials. From appoximation Theory to Algebra and Number Theory. Wiley and Sons, 1992.Google Scholar
  7. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Françoise Levy-dit-Vehel
    • 1
  • Simon Litsyn
    • 2
  1. 1.Domaine de VoluceauInstitut National de Recherche en Informatique et Automatique (INRIA)Le Chesnay CedexFrance
  2. 2.Dept. of Electrical Engineering-SystemsTel Aviv UniversityRamat Aviv, Tel AvivIsrael

Personalised recommendations