On Robust Colorings of Hamming-Distance Graphs

Electronic Journal Of Combinatorics

Isaiah Harney¹ 

关键词: Hamming distance;    Graphs;    Coloring;    Block codes;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

$H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colo

【 授权许可】

Others