Skip to main content
SpringerLink
Log in

Some constructions of perfect binary codes

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1993)

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

Abstract

A construction of perfect binary codes is presented. It is shown that this construction gives rise to perfect codes that are nonequivalent to any of the previously known perfect codes. Furthermore, perfect codes C 1 and C 2 are constructed such that their intersection C 1∩C 2 has the maximum possible cardinality. The latter result is then employed to explicitly construct 22cn nonequivalent perfect codes of length n, for sufficiently large n and some constant c slightly less than 0.5.

Research supported in part by the Rothschild Fellowship.

Research supported in part by the Technion V.P.R. fund and in part by the fund for the promotion of research at the Technion.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bauer, B. Ganter, and F. Hergert, Algebraic techniques for nonlinear codes, Combinatorics, 3 (1983), 21–33.

    Google Scholar 

  2. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Info. and Control, 23 (1973), 407–438.

    Google Scholar 

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

    Google Scholar 

  4. K.T. Phelps, A combinatorial construction of perfect codes, SIAM J. Alg. Disc. Meth., 4 (1983), 398–403.

    Google Scholar 

  5. K.T. Phelps, A general product construction for error-correcting codes, SIAM J. Alg. Disc. Meth., 5 (1984), 224–228.

    Google Scholar 

  6. J. L. Vasil'ev, On nongroup close-packed codes, Probl. Kibernet., 8 (1962), 375–378, (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, Almaden Research Center, 650 Harry Road, 95120, San Jose, CA

    Alexander Vardy

  2. Department of Computer Science, Technion-Israel Institute of Technology, 32000, Haifa, Israel

    Tuvi Etzion

Authors
  1. Alexander Vardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tuvi Etzion
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Teo Mora Oscar Moreno

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vardy, A., Etzion, T. (1993). Some constructions of perfect binary codes. In: Cohen, G., Mora, T., Moreno, O. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1993. Lecture Notes in Computer Science, vol 673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56686-4_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-56686-4_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56686-1

  • Online ISBN: 978-3-540-47630-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation