Balancing Cyclic R-ary Gray Codes

New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R−1} for all R ≥ 3, n ≥ 2. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each n ≥ 2, every transition count is within R − 1 of the average Rn/n, and for the 2-digit codes every transition count is either R2/2 or R2/2 .

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Mary Flahive, Bella Bose
• Keywords: COMBINATORICS 2007, N-digit Gray Codes, Transition Count