Skip to main content
SpringerLink
Log in

A Full Rank Perfect Code of Length 31

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

Abstract

A full rank perfect 1-error correcting binary code of length 31 with a kernel of dimension 21 is described. This was the last open case of the rank-kernel problem of Etzion and Vardy.

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 F. I. Solov’eva (1996) ArticleTitleOn the nonsystematic perfect binary codes Problems of Information Transmission 32 IssueID3 258–261 Occurrence Handle98b:94016

    MathSciNet  Google Scholar 

  2. S. V. Avgustinovich, O. Heden and F. I. Solov’eva, On ranks and kernels of perfect codes, Trita-mat-2001-13 (November 2001), Preprint KTH, Stockholm, Sweden.

  3. S. V. Avgustinovich O. Heden F. I. Solov’eva (2001) ArticleTitleFull rank perfect codes with big dimension kernels Discrete Analysis and Operation Research 1 IssueID8 3–8 Occurrence Handle2003b:94073

    MathSciNet  Google Scholar 

  4. S. V. Avgustinovich O. Heden F. I. Solov’eva (2003) ArticleTitleOn perfect codes ranks and kernels problems Problems of Information Transmission 39 IssueID4 30–34 Occurrence Handle10.1023/B:PRIT.0000011272.10614.8c Occurrence Handle2005g:94044

    Article  MathSciNet  Google Scholar 

  5. T. Etzion A. Vardy (1998) ArticleTitleOn perfect codes and tilings, problems and solutions SIAM Journal on Discrete Mathematics 11 IssueID2 205–223 Occurrence Handle10.1137/S0895480196309171 Occurrence Handle99f:94017

    Article  MathSciNet  Google Scholar 

  6. O. Heden, Perfect codes from the dual point of view I, submitted to Discrete Mathematics.

  7. O. Heden, A remark on full rank perfect codes, submitted to Discrete Mathematics.

  8. O. Heden, A property of the transpose of a perfect code, submitted to Discrete Mathematics.

  9. P. R. J. Östergård and A Vardy, Resolving the existence of full-rank tilings of binary Hamming spaces, SIAM Journal on Discrete Mathematics, to appear.

  10. K. T. Phelps M. Villanueva (2002) ArticleTitleOn perfect codes: rank and kernel Designs, Codes and Cryptography 27 183–194 Occurrence Handle2003i:94061

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, KTH, S-10044, Stockholm, Sweden

    Olof Heden

Authors
  1. Olof Heden
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olof Heden.

Additional information

Communicated by: D. Jungnickel

AMS Classification: 94B25

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heden, O. A Full Rank Perfect Code of Length 31. Des Codes Crypt 38, 125–129 (2006). https://doi.org/10.1007/s10623-005-5665-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-5665-1

Keywords

Search

Navigation