Skip to main content
SpringerLink
Log in

On the classification of perfect codes: side class structures

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

Abstract

The side class structure of a perfect 1-error correcting binary code (hereafter referred to as a perfect code) C describes the linear relations between the coset representatives of the kernel of C. Two perfect codes C and C′ are linearly equivalent if there exists a non-singular matrix A such that AC = C′ where C and C′ are matrices with the code words of C and C′ as columns. Hessler proved that the perfect codes C and C′ are linearly equivalent if and only if they have isomorphic side class structures. The aim of this paper is to describe all side class structures. It is shown that the transpose of any side class structure is the dual of a subspace of the kernel of some perfect code and vice versa; any dual of a subspace of a kernel of some perfect code is the transpose of the side class structure of some perfect code. The conclusion is that for classification purposes of perfect codes it is sufficient to find the family of all kernels 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. SV Avgustinovich O Heden FI Solov’eva (2003) ArticleTitleOn perfect codes ranks and kernels problem Prob Inform Transm 39 IssueID4 341–345 Occurrence Handle02205195 Occurrence Handle2102717 Occurrence Handle10.1023/B:PRIT.0000011272.10614.8c

    Article  MATH  MathSciNet  Google Scholar 

  2. MR Best (1983) ArticleTitlePerfect codes hardly exist IEEE Trans Info Theor. 29 IssueID3 349–351 Occurrence Handle0517.94013 Occurrence Handle712395 Occurrence Handle10.1109/TIT.1983.1056677

    Article  MATH  MathSciNet  Google Scholar 

  3. G Cohen S Litsyn A Vardy G Zémor (1996) ArticleTitleTilings of binary spaces SIAM J Discrete Math 9 393–412 Occurrence Handle0865.05032 Occurrence Handle1402187 Occurrence Handle10.1137/S0895480195280137

    Article  MATH  MathSciNet  Google Scholar 

  4. T Etzion E Vardy (1998) ArticleTitleOn perfect codes and tilings: problems and solutions SIAM J Discrete Math 11 IssueID2 205–223 Occurrence Handle0908.94035 Occurrence Handle1617153 Occurrence Handle10.1137/S0895480196309171

    Article  MATH  MathSciNet  Google Scholar 

  5. Golay MJE, Notes on digital coding. Proc. IRE 37(1949), Correspondance, 657

    Google Scholar 

  6. RW Hamming (1950) ArticleTitleError detecting and error correcting codes Bell Syst Tech J 29 147–160 Occurrence Handle35935

    MathSciNet  Google Scholar 

  7. O Heden (2006) ArticleTitleA full rank perfect code of length 31 Design Code Cryptygr 38 IssueID1 125–129 Occurrence Handle05027938 Occurrence Handle2191129 Occurrence Handle10.1007/s10623-005-5665-1

    Article  MATH  MathSciNet  Google Scholar 

  8. Hessler M, Perfect codes as isomorphic spaces, to appear in Discrete Mathematics

  9. M Hessler (2005) ArticleTitleA computer study of some 1-error correction perfect binary codes Australas J Combinat 33 217–229 Occurrence Handle02230932 Occurrence Handle2170359

    MATH  MathSciNet  Google Scholar 

  10. Kamps HJL, van Lint JH (1969) A covering problem. Colloc. Math. Soc. János Bolyai; Hung. Combin Thory. and Appl. Balatonfüred, Hungary, 679–685

  11. DS Krotov (2005) ArticleTitleLower bounds on the number of m-quasigroups of order 4 and the number of perfect binary codes Discrete Analysis Operation Res 1 IssueID72 47–53

    Google Scholar 

  12. VK Leontiev VA Zinoviev (1973) ArticleTitleNonexistence of perfect codes over galois fields Problems of Inform Theory 2 IssueID2 123–132

    Google Scholar 

  13. Östergård PRJ, Vardy A, Resolving the existence of full-rank tilings of binary Hamming spaces. SIAM Journal on Discrete Mathematics, to appear

  14. KT Phelps M Villanueva (2002) ArticleTitleOn perfect codes: rank and kernel Design Code Cryptogr 27 IssueID3 183–194 Occurrence Handle1020.94028 Occurrence Handle1928437 Occurrence Handle10.1023/A:1019936019517

    Article  MATH  MathSciNet  Google Scholar 

  15. F I Solov’eva, On Perfect Codes and Related Topics. Com2Mac Lecture Note Series 13, Pohang 2004

  16. A Tietäväinen (1973) ArticleTitleOn the nonexistence of perfect codes over finite fields SIAM J Appl Math 24 88–96 Occurrence Handle0251.94009 Occurrence Handle325260 Occurrence Handle10.1137/0124010

    Article  MATH  MathSciNet  Google Scholar 

  17. A Trachtenberg A Vardy (2003) ArticleTitleFull-Rank tilings of F 8 2 do not exist SIAM J Discrete Math 16 IssueID3 390–392 Occurrence Handle1032.94014 Occurrence Handle2002167 Occurrence Handle10.1137/S0895480102410213

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, KTH, S-100 44, Stockholm, Sweden

    Olof Heden

  2. Department of Mathematics, University of Linköping, S-581, Linköping, Sweden

    Martin Hessler

Authors
  1. Olof Heden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Hessler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olof Heden.

Additional information

Communicated by J.D. Key

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heden, O., Hessler, M. On the classification of perfect codes: side class structures. Des Codes Crypt 40, 319–333 (2006). https://doi.org/10.1007/s10623-006-0024-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0024-4

Keywords

AMS Classification

Search

Navigation