Balancing cyclic \(R\)-ary Gray codes. II. (Q1010863): Difference between revisions

Summary: New cyclic \(n\)-digit Gray codes are constructed over \(\{0, 1, \dots, R-1 \}\) for all \(R \geq 2\), \(n \geq 3\). These codes have the property that the distribution of digit changes (transition counts) between two successive elements is close to uniform. For \(R=2\), the construction and proof are simpler than earlier balanced cyclic binary Gray codes. For \(R \geq 3\) and \(n \geq 2\), every transition count is within 2 of the average \(R^n/n\). For even \(R >2\), the codes are as close to uniform as possible, except when there are two anomalous transition counts for \(R \equiv 2 \pmod{4}\) and \(R^n\) is divisible by \(n\). For Part I see ibid. 14. No. 1, Research paper R31, 14 p. (2007; Zbl 1165.94005).