Hamiltonicity ofMinimum Distance Graphsof 1-Perfect Codes

Electronic Journal Of Combinatorics

Alexander Mikhailovich Romanov¹ 

关键词: Hamiltonian cycle;    minimum distance graph;    Hamming code;    nonlinear code;    $q$-ary1-perfect code.;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A 1-perfect code $\mathcal{C}_{q}^{n}$ is called Hamiltonian if its minimum distance graph $G(\mathcal{C}_{q}^{n})$ contains a Hamiltonian cycle. In this paper, for  all admissible lengths $n \geq 13$, we construct   Hamiltonian nonlinear ternary 1-perfec

【 授权许可】

Others