Error propagation assessment of enumerative coding schemes

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 45; no. 7; pp. 2591 - 2594
Main Authors: Schouhamer Immink, K.A., Janssen, A.J.E.M.
Format: Journal Article
Language:English
Published: New York IEEE 01.11.1999
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Assessments
Channels
Codes
Coding
Constraints
Errors
Information technology
Information theory
Source coding
Vices
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 evaluates the effects of error propagation of the enumerative coding of runlength-limited sequences.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.796411