Abstract
Enumerative coding is an attractive algorithmic procedure for translating long source words into code-words and vice versa. The usage 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 |
|---|---|
| Title of host publication | ICC '98. 1998 IEEE International Conference on Communications |
| Place of Publication | Piscataway |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 961-963 |
| Number of pages | 3 |
| ISBN (Print) | 0-7803-4788-9 |
| DOIs | |
| Publication status | Published - 1 Jan 1998 |
| Externally published | Yes |
| Event | 1998 IEEE International Conference on Communications (ICC 1998) - Atlanta, GA, United States Duration: 7 Jun 1998 → 11 Jun 1998 |
Conference
| Conference | 1998 IEEE International Conference on Communications (ICC 1998) |
|---|---|
| Abbreviated title | ICC 1998 |
| Country/Territory | United States |
| City | Atlanta, GA, |
| Period | 7/06/98 → 11/06/98 |
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