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 ${\chi }_{\overline{k}}(n)$ be the number of colors required to color the $n$-dimensional hypercube such that no two vertices with the same color are at a distance at most $k$. In other words, ${\chi }_{\overline{k}}(n)$ is the minimum number of binary codes with minimum distance at least $k+1$ required to partition the $n$-dimensional Hamming space. By giving an explicit coloring, it is shown that ${\chi }_{\overline{2}}(8)=13$.

Similar Work

• Locally Linear Embedding Clustering Algorithm For Natural Imagery
• A Linear-time Approximation Of The Earth Movers Distance
• Perceptual Robust Hashing For Color Images With Canonical Correlation Analysis
• Fast Color Quantization Using Weighted Sort-means Clustering