Balancing cyclic \(R\)-ary Gray codes
The electronic journal of combinatorics, Tome 14 (2007)
New cyclic $n$-digit Gray codes are constructed over $\{0, 1, \ldots, R-1 \}$ for all $R \ge 3$, $n \ge 2$. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each $n \ge 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$.
@article{10_37236_949,
author = {Mary Flahive and Bella Bose},
title = {Balancing cyclic {\(R\)-ary} {Gray} codes},
journal = {The electronic journal of combinatorics},
year = {2007},
volume = {14},
doi = {10.37236/949},
zbl = {1165.94005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/949/}
}
Mary Flahive; Bella Bose. Balancing cyclic \(R\)-ary Gray codes. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/949
Cité par Sources :