Hamiltonicity of minimum distance graphs of 1-perfect codes

zbMath1243.05142MaRDI QIDQ426843

Alexander Mikhailovich Romanov

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p65

zbMATH Keywords

Hamming codeHamiltonian cyclenonlinear code\(q\)-ary 1-perfect codeminimum distance graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

On non-full-rank perfect codes over finite fields ⋮ On full-rank perfect codes over finite fields

This page was built for publication: Hamiltonicity of minimum distance graphs of 1-perfect codes