Document Type
Lecture
Publication Date
9-22-2005
Abstract
Huffman codes operating on binary trees have been used in many coding and communication systems. While these codes can compress data, they are very sensitive to channel errors. It is shown that a Huffman code may have self-synchronization strings (SSSs) which can stop the error propagation in decoding. Search of these strings and their occurrence probabilities are discussed. The decoding performance by incorporating SSSs with the maximum a-posteriori probability decoding is also presented.
Relational Format
presentation
Recommended Citation
Cao, Lei, "Decoding of Huffman codes with self-synchronization strings" (2005). Combinatorics Seminar. 90.
https://egrove.olemiss.edu/math_combinatorics/90
COinS
