Error propagation assessment of enumerative coding schemes

Kees A. Schouhamer Immink; Augustus J.E.M. Janssen

doi:10.1109/ICC.1998.685154

Error propagation assessment of enumerative coding schemes

Kees A. Schouhamer Immink, Augustus J.E.M. Janssen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

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	https://doi.org/10.1109/ICC.1998.685154
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

Access to Document

10.1109/ICC.1998.685154

Cite this

@inproceedings{7298e805116a494b8014fc6fc5ef0da0,

title = "Error propagation assessment of enumerative coding schemes",

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.",

author = "{Schouhamer Immink}, {Kees A.} and Janssen, {Augustus J.E.M.}",

year = "1998",

month = jan,

day = "1",

doi = "10.1109/ICC.1998.685154",

language = "English",

isbn = "0-7803-4788-9",

pages = "961--963",

booktitle = "ICC '98. 1998 IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "1998 IEEE International Conference on Communications (ICC 1998), ICC 1998 ; Conference date: 07-06-1998 Through 11-06-1998",

}

Schouhamer Immink, KA & Janssen, AJEM 1998, Error propagation assessment of enumerative coding schemes. in ICC '98. 1998 IEEE International Conference on Communications. Institute of Electrical and Electronics Engineers, Piscataway, pp. 961-963, 1998 IEEE International Conference on Communications (ICC 1998), Atlanta, GA, Georgia, United States, 7/06/98. https://doi.org/10.1109/ICC.1998.685154

Error propagation assessment of enumerative coding schemes. / Schouhamer Immink, Kees A.; Janssen, Augustus J.E.M.
ICC '98. 1998 IEEE International Conference on Communications. Piscataway: Institute of Electrical and Electronics Engineers, 1998. p. 961-963.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Error propagation assessment of enumerative coding schemes

AU - Schouhamer Immink, Kees A.

AU - Janssen, Augustus J.E.M.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031645375&partnerID=8YFLogxK

U2 - 10.1109/ICC.1998.685154

DO - 10.1109/ICC.1998.685154

M3 - Conference contribution

AN - SCOPUS:0031645375

SN - 0-7803-4788-9

SP - 961

EP - 963

BT - ICC '98. 1998 IEEE International Conference on Communications

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 1998 IEEE International Conference on Communications (ICC 1998)

Y2 - 7 June 1998 through 11 June 1998

ER -

Error propagation assessment of enumerative coding schemes

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this