On the binary codes with parameters of doubly-shortened 1-perfect codes

DOI10.1007/s10623-009-9360-5zbMath1201.94131arXiv0907.0002OpenAlexW4234318926MaRDI QIDQ2638426

Denis S. Krotov

Publication date: 16 September 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

embeddingequitable partitionperfect coloringdoubly-shortened 1-perfect codeone-perfect code

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (8)

Non-extendible Latin parallelepipeds ⋮ Perfect 2‐colorings of Hamming graphs ⋮ On the binary codes with parameters of triply-shortened 1-perfect codes ⋮ On weight distributions of perfect colorings and completely regular codes ⋮ Local duality for equitable partitions of a Hamming space ⋮ The extended 1-perfect trades in small hypercubes ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ Harmonic Distributions for Equitable Partitions of a Hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The triply shortened binary Hamming code is optimal
• The classification of some perfect codes
• On multifold MDS and perfect codes that are not splittable into onefold codes
• Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
• A General Product Construction for Error Correcting Codes
• n-Ary Quasigroups of Order 4
• A Census of Small Latin Hypercubes
• On Perfect Codes and Tilings: Problems and Solutions
• Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1
• Perfect binary codes: constructions, properties, and enumeration
• There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
• A survey of perfect codes
• On perfect binary codes

This page was built for publication: On the binary codes with parameters of doubly-shortened 1-perfect codes