Skip to main content
SpringerLink
Log in

Switching Equivalence Classes of Perfect Codes

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

Abstract

The authors present a 1-error correcting perfect code of length 15 and show that it is not switching equivalent to the Hamming code thereby settling a question of Avgustinovich and Solov'evaas96

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. S.V. Avgustinovich and F.I. Solov'eva, On projections of perfect binary codes, Proc. Seventh Joint Swedish-Russian Int. Workshop on Inform. Theory, St.-Petersburg, Russia (1995) pp. 25-26.

  2. S.V. Avgustinovich and F.I. Solov'eva, On non-systematic perfect binary codes, Problems of Information Transmission, Vol. 32,No. 3 (1996), pp. 258-261

    Google Scholar 

  3. S.V. Avgustinovich and F.I. Solov'eva, Construction of perfect binary codes by the sequential translations of i-components, Proc. Fifth Int.Workshop on Algebraic and Comb. coding Theory, Sozopol, Bulgaria, (1996) pp. 9-13.

  4. S.V. Avgustinovich, On a Property of Perfect Binary Codes, Operations Research and Discrete Analysis (1997) pp. 13-15.

  5. T. Etzion and A. Vardy, Perfect codes: constructions, properties and enumeration, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 754-763.

    Google Scholar 

  6. O. Heden, A binary perfect code of length 15 and codimension 0, Des. Codes and Cryptogr., Vol. 4 (1994) pp. 213-220.

    Google Scholar 

  7. R.A. Mathon, K.T. Phelps and A. Rosa, Small Steiner triple systems and their properties, Ars Combinat., Vol. 15 (1983) pp. 3-110.

    Google Scholar 

  8. B. D. McKay, Practical graph isomorphism, Congressus Numerantium, Vol. 30 (1981) pp. 45-87.

    Google Scholar 

  9. B. D. McKay, Nauty User's Guide, (version 1.5) http://cs.anu.edu.au/people/bdm/.

  10. K.T. Phelps, A combinatorial construction of perfect codes, SIAM J. Alg. Disc. Meth., Vol. 5 (1983) pp. 398-403.

    Google Scholar 

  11. K.T. Phelps and M. LeVan, Kernels of nonlinear Hamming codes, Des. Codes and Cryptogr., Vol. 6 (1995) pp. 247-257.

    Google Scholar 

  12. F.I. Solov'eva, On binary nongroup codes, Methody Diskr. Analiza, Vol. 37 (1981) pp. 65-76 (in Russian).

    Google Scholar 

  13. F.I. Solov'eva, Factorization of code generating d.n.f., Methody Diskr. Analiza, Vol. 47 (1988) pp. 66-88 (in Russian).

    Google Scholar 

  14. F.I. Solov'eva, Exact Bounds on the Connectivity of Code-Generated Disjunctive Normal Forms, Inst. Math. of the Siberian Branch of Acad. of Sciences, USSR, Preprint 10 (1990) pp. 15, (in Russian).

    Google Scholar 

  15. Y.L. Vasil'ev, On nongroup close-packed codes, Probleme der Kibernetik, Vol. 8 (1965) pp. 375-378 92–95.

    Google Scholar 

  16. Y.L. Vasil'ev and F.I. Solov'eva, Interdependence between perfect binary codes and their projections, Proc. Seventh Joint Swedish-Russian Int.Workshop on Inform. Theory, St.-Petersburg, Russia (1995) pp. 239-242.

Download references

Author information

Authors and Affiliations

  1. Department of Discrete and Statistical Sciences, Auburn University, 120 Math Annex, Auburn, AL, 36849-5307

    Kevin T. Phelps

Authors
  1. Kevin T. Phelps
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Phelps, K.T. Switching Equivalence Classes of Perfect Codes. Designs, Codes and Cryptography 16, 179–184 (1999). https://doi.org/10.1023/A:1017150214026

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017150214026

Search

Navigation