Pages that link to "Item:Q1237696"
From MaRDI portal
The following pages link to The triply shortened binary Hamming code is optimal (Q1237696):
Displaying 10 items.
- On the binary codes with parameters of triply-shortened 1-perfect codes (Q438873) (← links)
- Local duality for equitable partitions of a Hamming space (Q654902) (← links)
- On a hypercube coloring problem (Q703683) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound (Q1167704) (← links)
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes (Q2430684) (← links)
- On the binary codes with parameters of doubly-shortened 1-perfect codes (Q2638426) (← links)
- Combinatorial designs and perfect codes (Q3438986) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)
