On combinatorial Gray codes with distance 3

DOI10.1515/DMA.2009.027MaRDI QIDQ3225885zbMATH OpenFDO

Authors A. M. Romanov

Publication date 23 March 2012

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA.2009.027

zbMATH Keywords

binary codescombinatorial codescyclic codesgraphs of minimum distancesGray codesHamiltonian cyclesHamming codesperfect codes

Mathematics Subject Classification ID

Paths and cycles (05C38) Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• On distance Gray codes
• Binary Gray codes with long bit runs
• Linear time construction of a compressed Gray code
• Some remarks on the combinatories of Gray codes
• scientific article; zbMATH DE number 1353839

Cites work

• A Survey of Combinatorial Gray Codes

Cited in

(14)

• Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics
• Graphs induced by Gray codes
• Some complementary Gray codes
• Multidimensional Latin bitrades
• scientific article; zbMATH DE number 1353839 (Why is no real title available?)
• Hamiltonicity of minimum distance graphs of 1-perfect codes
• Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes
• The separability of standard cyclic N-ary Gray codes
• Some remarks on the combinatories of Gray codes
• On distance Gray codes
• scientific article; zbMATH DE number 2192090 (Why is no real title available?)
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Asymptotic estimates of a high degree of accuracy for the complexity of a universal multipole in a model of cellular circuits
• Gray coding cubic planar maps

This page was built for publication: On combinatorial Gray codes with distance 3

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