On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$
From MaRDI portal
Publication:5272302
DOI10.1109/TIT.2011.2147758zbMath1365.94384arXiv1104.4013MaRDI QIDQ5272302
Olli Pottonen, Patric R. J. Östergård, 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
Linear codes (general theory) (94B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items (6)
On the binary codes with parameters of triply-shortened 1-perfect codes ⋮ Switching codes and designs ⋮ The sextuply shortened binary Golay code is optimal ⋮ Classification of Graeco-Latin Cubes ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ Harmonic Distributions for Equitable Partitions of a Hypercube
This page was built for publication: On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$