Error propagation assessment of enumerative coding schemes

作     者：Immink, KAS Janssen, AJEM 

作者机构：Inst Expt Math D-45326 Essen Germany Philips Res Labs NL-5656 AA Eindhoven Netherlands 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：1999年第45卷第7期

页      面：2591-2594页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation  NSF  (9705738) 

主　　题：enumerative coding error propagation RLL 

摘      要：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 hit error could ruin entire decoded words. This contribution will evaluate the effects of error propagation of the enumerative coding of runlength-limited sequences.