Abstract

Let χkˉ(n)χ_{\bar{k}}(n) be the number of colors required to color the nn-dimensional hypercube such that no two vertices with the same color are at a distance at most kk. In other words, χkˉ(n)χ_{\bar{k}}(n) is the minimum number of binary codes with minimum distance at least k+1k+1 required to partition the nn-dimensional Hamming space. By giving an explicit coloring, it is shown that χ2ˉ(8)=13χ_{\bar{2}}(8)=13.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.