Balancing cyclic \(R\)-ary Gray codes (Q2372875)

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\).