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)
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
On a hypercube coloring problem, BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, On the acyclic chromatic number of Hamming graphs, Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound, Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes, On the binary codes with parameters of doubly-shortened 1-perfect codes, Combinatorial designs and perfect codes
Cites Work