PaperSwipe

Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes

Published 16 years agoVersion 2arXiv:0909.2526

Authors

Patric R. J. Östergård, Olli Pottonen

Categories

cs.IT

Abstract

The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. Östergård and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes.

Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes

16 years ago
v2
2 authors

Categories

cs.IT

Abstract

The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. Östergård and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes.

Authors

Patric R. J. Östergård, Olli Pottonen

arXiv ID: 0909.2526
Published Sep 14, 2009

Click to preview the PDF directly in your browser