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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 45; číslo 7; s. 2591 - 2594
Hlavní autoři: Schouhamer Immink, K.A., Janssen, A.J.E.M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.1999
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Assessments
Channels
Codes
Coding
Constraints
Errors
Information technology
Information theory
Source coding
Vices
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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