Abstract
Enumerative coding is an attractive algorithmic procedure for translating long source words into codewords and vice versa. The usage of long codewords makes it possible to approach a code rate which is as close as desired to Shannon's noiseless capacity of the constrained channel. Enumerative encoding is prone to massive error propagation as a single bit error could ruin entire decoded words. This contribution will evaluate the effects of error propagation of the enumerative coding of runlength-limited sequences.
| Original language | English |
|---|---|
| Pages (from-to) | 2591-2594 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 45 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1999 |
Fingerprint
Dive into the research topics of 'Error propagation assessment of enumerative coding schemes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver