Abstract
Skew-tolerant Gray codes are Gray codes in which changes in consecutive codewords occur in adjacent positions. We present the first construction of asymptotically non-vanishing skew-tolerant Gray codes, offering an exponential improvement over previous work. We also provide linear-time encoding and decoding algorithms for our codes. Finally, we extend the definition to non-binary alphabets, and provide constructions of complete m-ary skew-tolerant Gray codes for every base m ≥ 3 .
| Original language | English |
|---|---|
| Pages (from-to) | 8017-8028 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 71 |
| Issue number | 10 |
| DOIs | |
| State | Published - 1 Jan 2025 |
Keywords
- Gray codes
- graph-compatible gray codes
- skew tolerance
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Fingerprint
Dive into the research topics of 'Improved Constructions of Skew-Tolerant Gray Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver