Skip to main content
SpringerLink
Log in

Lower bound of covering radius of binary irreducible Goppa codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The lower bound of covering radius of binary irreducible Goppa codes is obtained.

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

Access this article

Log in via an institution

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. Bezzateev S.V., Shekhunova N.A.: Class of binary generalized Goppa codes perfect in weighted Hamming metric. In: Proceedings of WCC-2011, Paris, pp. 233–242 (2011)

  2. Bezzateev, S., Shekhunova, N.: Class of generalized Goppa codes perfect in weighted Hamming metric. Des. Codes Cryptogr. 66(1–3), 391–399 (2013)

  3. Carlitz L.: The arithmetic of polynomials in a Galois field. Am. J. Math. 54, 39–50 (1932)

  4. Cohen G., Frankl P.: Good coverings of Hamming spaces with spheres. Discret. Math. 56, 125–131 (1985)

  5. Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. North-Holland, Amsterdam (1997)

  6. Cohen G.D., Karpovsky M.G., Mattson Jr. H.F., Schatz J.R.: Covering radius survey and recent results. IEEE Trans. Inf. Theory 31, 328–343 (1985)

  7. Cohen G.D., Litsyn S.N., Lobstein A.C., Mattson Jr. H.F.: Covering radius 1985–1994. Appl. Algebra Eng. Commun. Comput. 8, 173–239 (1997)

  8. Cohen G.D., Lobstein A.C., Sloane N.J.A.: Further results of the covering radius of codes. IEEE Trans. Inf. Theory 32, 680–694 (1986)

  9. Feng G.L., Tzeng K.K.: On Quasi-perfect property of double-error-correcting Goppa codes and their complete decoding. Inf. Control 61, 132–146 (1984)

  10. Goppa V.D.: A new class of linear error correcting codes. Probl. Inf. Trans. 6(3), 24–30 (1970)

  11. Grassl M., Tomlinson M., Tjhai C.J., Jibril M., Ahmed M.Z.: Results on the covering radius of some best known binary codes, University of Plymouth (2011) (unpublished manuscript)

  12. Lang S.: Algebra, Reading Mass (3rd edn.), Addison-Wesley, Boston (1993)

  13. Levy-dit-Vehel F., Litsyn S.: Parameters of Goppa codes revisited. IEEE Trans. Inf. Theory, 1811–1819 (1997)

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

  15. Moreno O.: Goppa Codes Related Quasi-Perfect Double-Error-Correcting Codes. In: IEEE International Symposium Information Theory “Abstracts of Papers”, Santa Monica (1981)

  16. Moreno C.J., Moreno O.: Exponential sums and Goppa codes I. Proc. Am. Math. Soc. 111(2), 523–531 (1991)

  17. Tietavainen A.: Codes and Character Sums: Coding Theory and Application. Lecture Notes in Computer Science, vol. 388, pp. 3–12. Springer–Verlag, Berlin (1989)

  18. Vladuts S.G., Skorobogatov A.N.: Covering radius for long BCH codes, problemy peredachi inlormatsii, vol. 25, 38–45. Translated in: Probl. Inf. Trans., 25(1), 28–34 (1989)

Download references

Acknowledgments

The research leading to these results has received funding from the Ministry of Education and Science of the Russian Federation according to the project part of the state funding Assignment No. 2.2716.2014/K, July 17th, 2014.

Author information

Authors and Affiliations

  1. Saint Petersburg State University of Aerospace Instrumentation, Saint Petersburg, Russia

    Sergey Bezzateev & Natalia Shekhunova

Authors
  1. Sergey Bezzateev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia Shekhunova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey Bezzateev.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bezzateev, S., Shekhunova, N. Lower bound of covering radius of binary irreducible Goppa codes. Des. Codes Cryptogr. 82, 69–76 (2017). https://doi.org/10.1007/s10623-015-0173-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-015-0173-4

Keywords

Mathematics Subject Classification

Search

Navigation