Skip to main content
SpringerLink
Log in

Two New Four-Error-Correcting Binary Codes

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

Abstract

Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm.

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. E. Agrell A. Vardy K. Zeger (2001) ArticleTitleA table of upper bounds for binary codes IEEE Transactions on Information Theory. 47 3004–3006 Occurrence Handle10.1109/18.959279

    Article  Google Scholar 

  2. M.R. Best A.E. Brouwer F.J. MacWilliams A.M. Odlyzko N.J.A. Sloane (1978) ArticleTitleBounds for binary codes of length less than 25 IEEE Transactions on Information Theory. 24 81–93 Occurrence Handle10.1109/TIT.1978.1055827

    Article  Google Scholar 

  3. Elssel K., Zimmermann K.-H. Two new nonlinear binary codes, preprint.

  4. M. Kaikkonen (1998) ArticleTitleCodes from affine permutation groups Designs, Codes and Cryptography. 15 183–186

    Google Scholar 

  5. S. Niskanen P.R.J. Östergåa rd (2003) Cliquer user’s guide, Version 1.0, Technical Report T48. Communications Laboratory, Helsinki University of Technology, Espoo Finland.

    Google Scholar 

  6. P.R.J. Östergåa rd (2002) ArticleTitleClassifying subspaces of Hamming spaces Designs, Codes and Cryptography. 27 297–305

    Google Scholar 

  7. P.R.J. Östergåa rd (2002) ArticleTitleA fast algorithm for the maximum clique problem Discrete Applied Mathematics. 120 195–205

    Google Scholar 

  8. P.R.J. Östergåa rd M.K. Kaikkonen (1996) ArticleTitleNew single-error-correcting codes IEEE Transaction on Information Theory. 42 1261–1262 Occurrence Handle10.1109/18.508854

    Article  Google Scholar 

  9. Schrijver A., New code upper bounds from the Terwilliger algebra, preprint.

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 in PubMed Google Scholar

Corresponding author

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Östergård, P.R.J. Two New Four-Error-Correcting Binary Codes. Des Codes Crypt 36, 327–329 (2005). https://doi.org/10.1007/s10623-004-1723-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-004-1723-3

Keywords

Search

Navigation