Burst Error Recovery for Huffman Coding

Masato KITAKAMI  Satoshi NAKAMURA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E88-D   No.9   pp.2197-2200
Publication Date: 2005/09/01
Online ISSN: 
DOI: 10.1093/ietisy/e88-d.9.2197
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Algorithm Theory
Keyword: 
data compression,  bidirectionally decodable Huffman coding,  forbidden symbol,  burst error recovery,  

Full Text: PDF>>
Buy this Article




Summary: 
Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.