Geodesic
Binary Gray codes with long bit runs
The electronic journal of combinatorics, Tome 10 (2003)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
We show that there exists an $n$-bit cyclic binary Gray code all of whose bit runs have length at least $n - 3\log_2 n$. That is, there exists a cyclic ordering of $\{0,1\}^n$ such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of $n-3\log_2 n$ consecutive words. Such Gray codes are 'locally distance preserving' in that Hamming distance equals index separation for nearby words in the sequence.
DOI : 10.37236/1720
Classification : 05C38, 05C45, 68R15
Mots-clés : Hamilton cycle, Hamilton circle, spread, gap, threshold, Hamming distance 
Luis Goddyn; Pavol Gvozdjak. Binary Gray codes with long bit runs. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1720
@article{10_37236_1720,
     author = {Luis Goddyn and Pavol Gvozdjak},
     title = {Binary {Gray} codes with long bit runs},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1720},
     zbl = {1023.05080},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1720/}
}
TY  - JOUR
AU  - Luis Goddyn
AU  - Pavol Gvozdjak
TI  - Binary Gray codes with long bit runs
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1720/
DO  - 10.37236/1720
ID  - 10_37236_1720
ER  - 
%0 Journal Article
%A Luis Goddyn
%A Pavol Gvozdjak
%T Binary Gray codes with long bit runs
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1720/
%R 10.37236/1720
%F 10_37236_1720

Cité par Sources :