Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algebraic Coding

Algebraic Coding 1991: Algebraic Coding pp 23–31Cite as

Constructions of codes with covering radius 2

  • Conference paper
  • First Online:

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

Abstract

Constructions of nonbinary linear codes with covering radius R = 2 are considered. Infinite families of linear q-ary codes with R = 2, q ≥ 4, and a table of quaternary linear codes with R = 2, redundancy r ≤ 20, are given.

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. R. A. Brualdi, V. S. Pless, and R. M. Wilson, “Short codes with a given covering radius,” IEEE Trans. Inform. Theory, vol. IT-35, no. 1, pp. 99–109, Jan. 1989.

    Article  Google Scholar 

  2. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Shatz, “Covering radius — Survey and recent results,” IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 328–343, May 1985.

    Article  Google Scholar 

  3. G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, “Further results on the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-32, no. 5, pp. 680–694, Sept. 1986.

    Article  Google Scholar 

  4. A. A. Davydov, “Construction of linear covering codes,” Probl. Peredach. Inform., vol. 26, no. 4, pp. 38–55, Oct.–Dec.1990. (In Russian).

    Google Scholar 

  5. A. A. Davydov, “Constructions and families of q-ary linear covering codes and saturated sets of points in projective geometry,” in Proc. v Joint Soviet-Swedish Intern. Workshop on Inform. Theory “Convolutional Codes; Multi-user Communication”, Moscow, USSR, pp. 46–49, Jan. 1991.

    Google Scholar 

  6. E. M. Gabidulin, A. A. Davydov, and L. M. Tombak, “Codes with covering radius 2 and other new covering codes,” IEEE Trans. Inform. Theory, vol. IT-37, no. 1, pp. 219–224, Jan. 1991.

    Article  MathSciNet  Google Scholar 

  7. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 385–401, May 1985.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Problems of Cybernetics of the USSR Academy of Sciences, Vavilov street 37, 117312, Moscow, USSR

    Alexander A. Davydov

Authors
  1. Alexander A. Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Antoine Lobstein Gilles Zémor Simon Litsyn

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Davydov, A.A. (1992). Constructions of codes with covering radius 2. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034337

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55130-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation