A Coloring Of The Square Of The 8-cube With 13 Colors
Kokkala Janne I., Östergård Patric R. J.. Arxiv 2015
[Paper]
ARXIV
Let be the number of colors required to color the
-dimensional hypercube such that no two vertices with the same color are at
a distance at most . In other words, is the minimum
number of binary codes with minimum distance at least required to
partition the -dimensional Hamming space. By giving an explicit coloring, it
is shown that .
Similar Work