104 search results - page 2 / 21 » The Gray Code |
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Lee distance Gray codes for -ary Ò-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamilto...
COMBINATORICS
2007
13 years 5 months ago
2007
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 (transi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
TIT
2008
13 years 5 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
IPL
2000
13 years 5 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...