On Optimal Binary One-Error-Correcting Codes of Lengths 2ᵐ-4 and 2ᵐ-3

DOI10.1109/TIT.2011.2147758MaRDI QIDQ5272302zbMATH OpenFDO

Authors Patric R. J. Östergård, Olli Pottonen, Denis S. Krotov

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.4013

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Linear codes (general theory) (94B05)

Abstract: Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computer-aided classification of the optimal binary one-error-correcting codes of lengths 12 and 13 possible; there are 237610 and 117823 such codes, respectively (with 27375 and 17513 inequivalent extensions). This completes the classification of optimal binary one-error-correcting codes for all lengths up to 15. Some properties of the classified codes are further investigated. Finally, it is proved that for any $mgeq4$, there are optimal binary one-error-correcting codes of length $2^m-4$ and $2^m-3$ that cannot be lengthened to perfect codes of length $2^m-1$.

Cited in

(11)

• The sextuply shortened binary Golay code is optimal
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• scientific article; zbMATH DE number 3920367 (Why is no real title available?)
• On the binary codes with parameters of triply-shortened 1-perfect codes
• scientific article; zbMATH DE number 6807172 (Why is no real title available?)
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
• Harmonic distributions for equitable partitions of a hypercube
• Classification of Graeco-Latin Cubes
• Switching codes and designs
• Several infinite families of binary cyclic codes with optimal parameters
• Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes

This page was built for publication: On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272302)