More on the Error Recovery for Variable-Length Codes
Document Type
Article
Date of Original Version
1-1-1995
Abstract
Variable-length codes (e.g., Huffman codes) are commonly employed to minimize the average codeword length for noiseless encoding of discrete sources. Upon transmission over noisy channels, conflicting views note that such codes “tend to be self-synchronizing” and suffer from the “catastrophic effect of the error's propagation.” In 1985, Maxted and Robinson used a state model to describe the error recovery of the decoder. This correspondence extends their results in several ways. © 1995 IEEE.
Publication Title, e.g., Journal
IEEE Transactions on Information Theory
Volume
41
Issue
6
Citation/Publisher Attribution
Swaszek, Peter F., and Peter DiCicco. "More on the Error Recovery for Variable-Length Codes." IEEE Transactions on Information Theory 41, 6 (1995): 2064-2071. doi: 10.1109/18.476338.
COinS