Balancing cyclic \(R\)-ary Gray codes. II.

zbMath1180.94041MaRDI QIDQ1010863

Mary E. Flahive

Publication date: 7 April 2009

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

Full work available at URL: https://eudml.org/doc/117272

zbMATH Keywords

balanced cyclic binary Gray codescyclic \(n\)-digit Gray codesdigit changestransition counts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Applications of graph theory to circuits and networks (94C15) Cyclic codes (94B15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Reordering columns for smaller indexes ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers

This page was built for publication: Balancing cyclic \(R\)-ary Gray codes. II.