On locally balanced gray codes

DOI10.1134/S1990478916010099zbMath1349.94152MaRDI QIDQ3186855

I. S. Bykov

Publication date: 12 August 2016

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

zbMATH Keywords

Hamilton cycleGray coden-cubewindow width of a code

Mathematics Subject Classification ID

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

Related Items (5)

Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations ⋮ On distance Gray codes ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube

Cites Work

• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
• Binary Gray codes with long bit runs
• Counting Hamiltonian cycles in bipartite graphs
• A Survey of Combinatorial Gray Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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