By Topic

More on the error recovery for variable-length codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Swaszek, P.F. ; Dept. of Electr. & Comput. Eng., Rhode Island Univ., Kingston, RI, USA ; DiCicco, P.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 6 )