Binary Gray Codes with Long Bit Runs (2003) [3 citations — 0 self]
Download:
|
|
by Luis Goddyn, Pavol Gvozdjak
Electronic Journal of Combinatorics
http://www.math.sfu.ca/~goddyn/Papers/012-gray-long-bit-runs.ps
Add To MetaCart
Abstract:
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 f0; 1g n such that adjacent words dier 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.
Citations
| 43 | A survey of combinatorial Gray codes – Savage - 1997 |
| 10 | Some new circuit codes – Paterson, Tuliani - 1998 |
| 1 | Evdokimov, Numeration of subsets of a set – A - 1980 |
| 1 | Compact Ultraviolet Imaging Microchannel Plate Detectors using CODed Anode CONverter (CODACON) Readout Systems – Lawrence, McClintlock - 1996 |
| 1 | The structure and construction of super Gray codes – Thorne - 1993 |
| 1 | Zanten, Agung Lukito, Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics. Des – van - 1999 |
| 1 | Evdokimov, Numeration of subsets of a finite set – A - 1980 |
