Abstract
The optimal one-error-correcting codes of length 13 that are doubly shortened perfect codes are classified utilizing the results of [Östergård, P.R.J., Pottonen, O.: The perfect binary one-error-correcting codes of length 15: Part I—Classification. IEEE Trans. Inform. Theory 55, 4657–4660 (2009)]; 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.
Similar content being viewed by others
References
Avgustinovich S.V., Krotov D.S.: Embedding in a perfect code. J. Combin. Des. 17, 419–423 (2009)
Best M.R., Brouwer A.E.: The triply shortened binary Hamming code is optimal. Discrete Math. 17, 235–245 (1977)
Blackmore T.: Every binary \({(2^m-2,2^{2^m-2-m},3)}\) code can be lengthened to form a perfect code of length 2m − 1. IEEE Trans. Inform. Theory 45, 698–700 (1999)
Etzion T., Vardy A.: Perfect binary codes: constructions, properties, and enumeration. IEEE Trans. Inform. Theory 40, 754–763 (1994)
Etzion T., Vardy A.: On perfect codes and tilings: problems and solutions. SIAM J. Discrete Math. 11, 205–223 (1998)
Kaski P., Pottonen O.: libexact user’s guide, version 1.0. Technical Report HIIT TR 2008-1, Helsinki Institute for Information Technology HIIT, Helsinki (2008).
Östergård P.R.J., Pottonen O.: The perfect binary one-error-correcting codes of length 15: Part I—Classification. IEEE Trans. Inform. Theory 55, 4657–4660 (2009)
Östergård P.R.J., Pottonen O., Phelps K.T.: The perfect binary one-error-correcting codes of length 15: Part II—Properties. IEEE Trans. Inform. Theory 56, 2571–2582 (2010)
Phelps K.T., LeVan M.: Kernels of nonlinear Hamming codes. Des. Codes Cryptogr. 6, 247–257 (1995)
Solov’eva F.I.: Factorization of code-generating disjunctive normal forms (in Russian). Metody Diskret. Analiz. 47, 66–88 (1988)
Solov’eva F.I.: Structure of i-components of perfect binary codes. Discrete Appl. Math. 111, 189–197 (2001)
West D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Östergård, P.R.J., Pottonen, O. Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. Des. Codes Cryptogr. 59, 281–285 (2011). https://doi.org/10.1007/s10623-010-9450-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-010-9450-4