Skip to main content
SpringerLink
Log in

Two new bounds on the size of binary codes with a minimum distance of three

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

Abstract

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)≤76 andA(11, 3)≤152.

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. J. L. Allston, R. W. Buskens, and R. G. Stanton, An examination of the nonisomorphic solutions to a problem in covering designs in fifteen points.Math. Comp., Vol. 4 (1988) pp. 189–206.

    Google Scholar 

  2. M. R. Best, Binary codes with a minimum distance of four,IEEE Trans. Inform. Theory, Vol. IT-26 (1980) pp. 738–742.

    Google Scholar 

  3. M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane, Bounds for binary codes of length less than 25,IEEE Trans. Inform. Theory, Vol. IT-24 (1978) pp. 81–93.

    Google Scholar 

  4. J. H. Conway and N. J. A. Sloane,Sphere Packings, Lattices and Groups, Springer-Verlag, New York (1988).

    Google Scholar 

  5. J. H. Conway and N. J. A. Sloane, Quaternary constructions for the binary codes of Julin, Best, and others,Designs, Codes, and Cryptography, to appear.

  6. D. Julin, Two improved block codes.IEEE Trans. Inform. Theory, Vol. IT-11 (1965) p. 459.

    Google Scholar 

  7. D. E. Knuth,The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA (1973).

    Google Scholar 

  8. S. Litsyn and A. Vardy, The uniqueness of the Best code,IEEE Trans. Inform. Theory. to appear.

  9. F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes, North-Holland, New York (1977).

    Google Scholar 

  10. N. Wax, On upper bounds for error-detecting and error-correcting codes of finite length.IEEE Trans. Inform. Theory, Vol. IT-5 (1959) pp. 168–174.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering-Systems, Tel-Aviv University, 69978, Ramat-Aviv, Israel

    Yaron Klein & Simon Litsyn

  2. Coordinated Science Laboratory, University of Illinois, 1308 W. Main Street, 61801, Urbana, IL, USA

    Alexander Vardy

Authors
  1. Yaron Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Litsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Vardy
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by: D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klein, Y., Litsyn, S. & Vardy, A. Two new bounds on the size of binary codes with a minimum distance of three. Des Codes Crypt 6, 219–227 (1995). https://doi.org/10.1007/BF01388476

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation