Balancing cyclic R-ary Gray codes

MaRDI QIDQ2372875zbMATH OpenFDO

Authors Mary E. Flahive, Bella Bose

Publication date 16 July 2007

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

Full work available at URL https://eudml.org/doc/130370, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r31.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Review text

Summary: New cyclic \(n\)-digit Gray codes are constructed over \(\{0, 1, \dots, R-1 \}\) for all \(R \geq 3\), \(n \geq 2\). These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each~\(n \geq 2\), every transition count is within \(R-1\) of the average~\(R^n/n\), and for the \(2\)-digit codes every transition count is either \(\lfloor{R^2/2} \rfloor\) or \(\lceil{R^2/2} \rceil\).

Recommendations

• Balancing cyclic \(R\)-ary Gray codes. II.
• Balanced Gray codes
• scientific article; zbMATH DE number 4139306
• scientific article; zbMATH DE number 2239558
• A simple proof for the existence of exponentially balanced Gray codes

Cited in

(5)

• Balancing cyclic \(R\)-ary Gray codes. II.
• Balanced Gray codes
• Cyclic arrangements with minimum modulo \(m\) winding numbers
• Reordering columns for smaller indexes
• Sample compression for real-valued learners

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

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