The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties

DOI10.1109/TIT.2010.2046197zbMath1366.94606MaRDI QIDQ5281435

Kevin T. Phelps, Patric R. J. Östergård, Olli Pottonen

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (17)

On non-full-rank perfect codes over finite fields ⋮ An enumeration of 1-perfect ternary codes ⋮ On perfect 2-colorings of the \(q\)-ary \(n\)-cube ⋮ On full-rank perfect codes over finite fields ⋮ Bussey systems and Steiner's tactical problem ⋮ Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes ⋮ A note on the symmetry group of full rank perfect binary codes ⋮ Switching codes and designs ⋮ Transitive nonpropelinear perfect codes ⋮ Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\) ⋮ A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\) ⋮ On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes ⋮ Unnamed Item ⋮ Affine 3-nonsystematic codes ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation ⋮ On separability of the classes of homogeneous and transitive perfect binary codes

This page was built for publication: The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties