Skip to main content
Springer Nature Link
Log in

Binary Two-Error-Correcting Codes are Better than Quaternary

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

Codes over large fields can be used to construct codes over subfields. Such constructions of covering and error-correcting codes are discussed. In particular, packings and coverings with spheres of radius two are considered. A new construction of binary two-error-correcting codes from quaternary two-error-correcting codes is presented. This construction maintains the density, showing that such binary codes are at least as good as quaternary codes. The same construction is used to arrive at a similar conclusion for covering codes.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Blinovsky, V.: Asymptotic Combinatorial Coding Theory. Boston: Kluwer, 1997

  2. Brouwer, A.E.: Bounds on the size of linear codes. In: Pless, V. S., Huffman, W. C. (eds.) Handbook of Coding Theory, Vol. I, Amsterdam: North-Holland, 1998, pp. 295–461

  3. Brouwer, A.E., Tolhuizen, L.M.G.M.: A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters. Des. Codes Cryptogr. 3, 95–98 (1993)

    MathSciNet  MATH  Google Scholar 

  4. Brualdi, R.A., Pless, V.S.: On the length of codes with a given covering radius. In: Ray-Chaudhuri, D. (ed.) Coding Theory and Design Theory, Part I, New York: Springer-Verlag, 1990, pp. 9–15

  5. Brualdi, R.A., Pless, V.S., Wilson, R.M.: Short codes with a given covering radius. IEEE Trans. Inform. Theory 35, 99–109 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cock, J.C., Östergård, P.R.J.: Ternary covering codes derived from BCH codes. J. Combin. Theory. Ser. A 80, 283–289 (1997)

    Article  MATH  Google Scholar 

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

  8. Davydov, A.A.: Constructions of codes with covering radius 2. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds.) Algebraic Coding. Lecture Notes in Computer Science, Vol. 573, Berlin: Springer-Verlag, 1992, pp. 23–31

  9. Davydov, A.A.: Constructions and families of covering codes and saturated sets of points in projective geometry. IEEE Trans. Inform. Theory 41, 2071–2080 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Davydov, A.A.: Constructions and families of nonbinary linear codes with covering radius 2. IEEE Trans. Inform. Theory 45, 1679–1686 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Davydov, A.A., Östergård, P.R.J.: New linear codes with covering radius 2 and odd basis. Des. Codes Cryptogr. 16, 29–39 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dumer, I.I.: Nonbinary codes with distances 4, 5, and 6 of cardinality greater than the BCH codes. (in Russian). Probl. Peredach. Inform. 24(3), 42–54 (1988), English translation in Probl. Inform. Trans. 24, 205–214 (1988)

    MATH  Google Scholar 

  13. Dumer, I.I.: On nonbinary codes with fixed distance. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds.) Algebraic Coding. Lecture Notes in Computer Science, Vol. 573, Berlin: Springer-Verlag, 1992, pp. 67–74

  14. Dumer, I.I., Zinoviev, V.A.: Some new maximal codes over the Galois field GF(4). (in Russian). Probl. Peredach. Inform. 14(3), 24–34 (1978), English translation in Probl. Inform. Trans. 14, 174–181 (1978)

    MATH  Google Scholar 

  15. Gabidulin, E.M., Davydov, A.A., Tombak, L.M.: Linear codes with covering radius 2 and other new covering codes. IEEE Trans. Inform. Theory 37, 219–224 (1991)

    Article  MATH  Google Scholar 

  16. Goethals, J.-M, Snover, S.L.: Nearly perfect binary codes. Discrete Math. 3, 65–88 (1972)

    Article  MATH  Google Scholar 

  17. Kabatyanskii, G.A., Panchenko, V.I.: Unit sphere packings and coverings of the Hamming space. (in Russian). Probl. Peredach. Inform. 24(4), 3–16 (1988), English translation in Probl. Inform. Trans. 24, 261–272 (1988)

    Google Scholar 

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

  19. Simonis, J.: The [23,14,5] Wagner code is unique. Discrete Math. 213, 269–282 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wagner, T.J.: A search technique for quasi-perfect codes. Inform. and Control 9, 94–99 (1966)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Communications Engineering, Helsinki University of Technology, P.O. Box 3000, 02015, HUT, Finland

    Patric R. J. Östergård

Authors
  1. Patric R. J. Östergård
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Patric R. J. Östergård.

Additional information

Keywords: Bounds on codes, Covering code, Error-correcting code, Finite field.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Östergård, P. Binary Two-Error-Correcting Codes are Better than Quaternary. AAECC 14, 89–96 (2003). https://doi.org/10.1007/s00200-003-0128-2

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-003-0128-2

Keywords