More on the error recovery for variable-length codes

  • Authors:

  • P. F. Swaszek;P. DiCicco

  • Affiliations:

  • Dept. of Electr. & Comput. Eng., Rhode Island Univ., Kingston, RI;-

  • Venue:
  • IEEE Transactions on Information Theory - Part 2
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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”. Maxted and Robinson (1985) used a state model to describe the error recovery of the decoder. The present paper extends their results in several ways