The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification

Related Items (20)

Non-existence of a ternary constant weight $(16,5,15;2048)$ diameter perfect code ⋮ An enumeration of 1-perfect ternary codes ⋮ Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14 ⋮ 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 ⋮ Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001 ⋮ Note on the size of binary Armstrong codes ⋮ Switching codes and designs ⋮ The sextuply shortened binary Golay code is optimal ⋮ Linear maps of perfect codes and irregular $C$-partitions ⋮ A Partition of the Hypercube into Maximally Nonparallel Hamming Codes ⋮ Connectivity and edge-bipancyclicity of Hamming shell ⋮ Classification of Graeco-Latin Cubes ⋮ On the size of the symmetry group of a perfect code ⋮ On the $\mathrm{OA}(1536,13,2,7)$ and related orthogonal arrays ⋮ The complete k-arcs of PG(2, 27) and PG(2, 29) ⋮ 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 <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification