The triply shortened binary Hamming code is optimal
From MaRDI portal
Publication:1237696
Cited in
(10)- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- The chromatic number of the square of the 8-cube
- Combinatorial designs and perfect codes
- On the binary codes with parameters of triply-shortened 1-perfect codes
- 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
- On a hypercube coloring problem
- 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
- Local duality for equitable partitions of a Hamming space
This page was built for publication: The triply shortened binary Hamming code is optimal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237696)
