Skip to main content
SpringerLink
Log in

On Perfect Codes: Rank and Kernel

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

Abstract

We establish upper and lower bounds on the rank and the dimension of the kernel of perfect binary codes. We also establish some results on the structure of perfect codes.

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. H. Bauer, B. Ganter and F. Hergert, Algebraic techniques for nonlinear codes, Combinatorica, Vol. 3 (1983) pp. 21–33.

    Google Scholar 

  2. A. Bonisoli, Every equidistant linear code is a sequence of dual Hamming codes, Ars Combin., Vol. 18 (1984) pp. 181–186.

    Google Scholar 

  3. J. Doyen, X. Hubaut and M. Vandensavel, Ranks of incidence matrices of Steiner triple systems, Math. Z., Vol. 163 (1978) pp. 251–259.

    Google Scholar 

  4. T. Etzion and A. Vardy, Perfect binary codes: constructions, properties, and enumeration, IEEE Trans. on Information Theory, Vol. 40 (1994) pp. 754–763.

    Google Scholar 

  5. T. Etzion and A Vardy, On perfect codes and tilings: problems and solutions, SIAM J. Discrete Math.,Vol. 11 No.2 (1998) pp. 205–223.

    Google Scholar 

  6. F. Hergert, Algebraische methoden fur nichtlineare codes, Dissertation, Technischen Hochschule Darmstadt (1985).

  7. J.D. Key and F. E. Sullivan, Codes of Steiner triple and quadruple systems, Des., Codes, Cryptog., Vol. 3, No.2 (1993) pp. 117–125.

    Google Scholar 

  8. K.T. Phelps, A combinatorial construction of perfect codes, SIAM J. Alg. Disc. Math. Vol. 5 (1983) pp. 398–403.

    Google Scholar 

  9. K.T. Phelps, An enumeration of 1-perfect binary codes of length 15, Australasian Journal of Combinatorics, Vol. 21 (2000) pp. 287–298.

    Google Scholar 

  10. K. T. Phelps and M. LeVan, Kernels of nonlinear Hamming codes, Designs, Codes and Cryptography, Vol. 6 (1995) pp. 247–257.

    Google Scholar 

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

    Google Scholar 

  12. L. Teirlinck, On making two Steiner triple systems disjoint, J. Combinat. Theory (A), Vol. 23 (1977) pp. 349–350.

    Google Scholar 

  13. L. Teirlinck, On projective and affine hyperplanes, J. Combinatorial Theory, Ser. A, Vol. 28 (1980) pp. 290–306.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Discrete & Statistical Sciences, Auburn University, Auburn, Al, 36849-5307

    Kevin T. Phelps & Mercè Villanueva

Authors
  1. Kevin T. Phelps
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mercè Villanueva
    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., Villanueva, M. On Perfect Codes: Rank and Kernel. Designs, Codes and Cryptography 27, 183–194 (2002). https://doi.org/10.1023/A:1019936019517

Download citation

  • Issue Date:

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

Search

Navigation