Title :
Guaranteed Synchronization of Huffman Codes
Author :
Biskup, Marek Tomasz
Author_Institution :
Warsaw Univ., Warsaw
Abstract :
In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting such error propagation to not more than L bits, L being a parameter of the algorithm. The method utilizes the inherent tendency of the codes to synchronize spontaneously and does not introduce any redundancy if such a synchronization takes place.
Keywords :
Huffman codes; synchronisation; text analysis; Huffman codes; error propagation; synchronization; text coding; Automata; Binary trees; Data compression; Decoding; Delay; H infinity control; Huffman coding; Informatics; Redundancy; Testing; Huffman Code; error resilience; synchronization; synchronization delay;
Conference_Titel :
Data Compression Conference, 2008. DCC 2008
Conference_Location :
Snowbird, UT
Print_ISBN :
978-0-7695-3121-2
DOI :
10.1109/DCC.2008.23
