Tingting Wu

New results on hypercube coloring problem from linear codes over Z2k

This paper is concerned with the hypercube coloring problem. Let 𝜒 ℓ ⁡ ( 𝑚 ) be the minimum number of colors needed to color the vertices of a hypercube with 2 𝑚 vertices such that every two vertices with Hamming distance ≤ ℓ have different colors. Using linear codes over ℤ 2 𝑘 (...