On locally balanced Gray codes

DOI10.1134/S1990478916010099MaRDI QIDQ3186855zbMATH OpenFDO

Authors I. S. Bykov

Publication date 12 August 2016

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1990478916010099

zbMATH Keywords

Gray codeHamilton cyclen-cubewindow width of a code

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• Balanced Gray codes
• Generalized Gray codes with prescribed ends
• scientific article; zbMATH DE number 2239558
• On distance Gray codes
• A simple proof for the existence of exponentially balanced Gray codes

Cites work

• A Survey of Combinatorial Gray Codes
• Binary Gray codes with long bit runs
• Counting Hamiltonian cycles in bipartite graphs
• scientific article; zbMATH DE number 3756478 (Why is no real title available?)
• scientific article; zbMATH DE number 5239125 (Why is no real title available?)
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
• Towards a classification of Hamiltonian cycles in the 6-cube

Cited in

(9)

• Balancing cyclic \(R\)-ary Gray codes. II.
• Balanced Gray codes
• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• A simple proof for the existence of exponentially balanced Gray codes
• Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
• 2-Factors without close edges in the n-dimensional cube
• On distance Gray codes
• scientific article; zbMATH DE number 2239558 (Why is no real title available?)

This page was built for publication: On locally balanced Gray codes

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