Top

Designs, Codes and Cryptography

Published in:

20-01-2016

Lower bound of covering radius of binary irreducible Goppa codes

Authors: Sergey Bezzateev, Natalia Shekhunova

Published in: Designs, Codes and Cryptography | Issue 1-2/2017

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

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

previous article MacWilliams Extension Theorem for MDS codes over a vector space alphabet

next article On the direct construction of recursive MDS matrices

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)

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

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

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

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

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)

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)

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)

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)

Title: Lower bound of covering radius of binary irreducible Goppa codes
Authors: Sergey Bezzateev
Natalia Shekhunova
Publication date: 20-01-2016
Publisher: Springer US
Published in: Designs, Codes and Cryptography / Issue 1-2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0173-4

Springer Professional

Lower bound of covering radius of binary irreducible Goppa codes

Abstract

Premium Partner

Springer Professional

Abstract

Please log in to get access to your license.

Other articles of this Issue 1-2/2017

Cover-free codes and separating system codes

MacWilliams Extension Theorem for MDS codes over a vector space alphabet

Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity

Algebraic decoding of folded Gabidulin codes

Improving the security and efficiency of block ciphers based on LS-designs

Row reduction applied to decoding of rank-metric and subspace codes

Premium Partner