Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes

zbMATH Open1375.05161MaRDI QIDQ4595650FDOQ4595650

Authors: A. M. Romanov 

Publication date: 6 December 2017

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/69/ajc_v69_p215.pdf

Recommendations

• Hamiltonicity of minimum distance graphs of 1-perfect codes
• On combinatorial Gray codes with distance 3
• Perfect codes over graphs
• The covering radius of the cycle code of a graph
• Perfect codes in circulant graphs

zbMATH Keywords

binary Hamming codenonlinear binary 1-perfect code

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (3)

• Hamiltonicity of minimum distance graphs of 1-perfect codes
• Dominated error correcting codes with distance two
• On nonlinear 1-quasi-perfect codes and their structural properties

This page was built for publication: Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595650)