Geodesic
Balanced Gray codes
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is shown that balanced $n$-bit Gray codes can be constructed for all positive integers $n$. A balanced Gray code is one in which the bit changes are distributed as equally as possible among the bit positions. The strategy used is to prove the existence of a certain subsequence which will allow successful use of the construction proposed by Robinson and Cohn in 1981. Although Wagner and West proved in 1991 that balanced Gray code schemes exist when $n$ is a power of 2, the question for general $n$ has remained open since 1980 when it first attracted attention.
DOI : 10.37236/1249
Classification : 94B60, 05C45, 05C38
Mots-clés : balanced \(n\)-bit Gray codes 
@article{10_37236_1249,
     author = {Girish S. Bhat and Carla D. Savage},
     title = {Balanced {Gray} codes},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1249},
     zbl = {0917.94019},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1249/}
}
TY  - JOUR
AU  - Girish S. Bhat
AU  - Carla D. Savage
TI  - Balanced Gray codes
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1249/
DO  - 10.37236/1249
ID  - 10_37236_1249
ER  - 
%0 Journal Article
%A Girish S. Bhat
%A Carla D. Savage
%T Balanced Gray codes
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1249/
%R 10.37236/1249
%F 10_37236_1249
Girish S. Bhat; Carla D. Savage. Balanced Gray codes. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1249

Cité par Sources :