Guaranteed Synchronization of Huffman Codes with Known Position of Decoder
DCC '08 Proceedings of the Data Compression Conference(2009)
Abstract
In Huffman-encoded data a bit error may propagate arbitrarily long. This paper introduces a method for limiting such error propagation to at most $L$ bits, $L$ being a parameter. It is required that the decoder knows the bit number currently being decoded. The method utilizes the inherent tendency of Huffman codes to resynchronize spontaneously and does not introduce any redundancy if such a~resynchronization takes place. The method is applied to parallel decoding of Huffman data and is tested on Jpeg compression.
MoreTranslated text
Key words
Huffman codes,decoding,Huffman codes synchronization,JPEG compression,bit error propagation,parallel decoding,Huffman Code,Jpeg compression,error resilience,paralled Huffman decompression,synchronization
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined