The triply shortened binary Hamming code is optimal
From MaRDI portal
Publication:1237696
DOI10.1016/0012-365X(77)90158-3zbMath0356.94009WikidataQ126350687 ScholiaQ126350687MaRDI QIDQ1237696
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
On the binary codes with parameters of doubly-shortened 1-perfect codes ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ On the binary codes with parameters of triply-shortened 1-perfect codes ⋮ Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound ⋮ Local duality for equitable partitions of a Hamming space ⋮ The chromatic number of the square of the $8$-cube ⋮ On a hypercube coloring problem ⋮ On the acyclic chromatic number of Hamming graphs ⋮ Combinatorial designs and perfect codes
Cites Work
This page was built for publication: The triply shortened binary Hamming code is optimal
