Name
Abstract | ||
|---|---|---|
Let $chi_{bar{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_{bar{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_{bar{2}}(8)=13$. |
Year | Venue | Field |
|---|---|---|
2015 | arXiv: Combinatorics | 8-cube,Discrete mathematics,Combinatorics,Vertex (geometry),Binary code,Hamming space,Partition (number theory),Hypercube,Mathematics |
DocType | Volume | Citations |
Journal | abs/1509.06913 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janne I. Kokkala | 1 | 9 | 2.46 |
| Patric R. J. Östergård | 2 | 609 | 70.61 |