Title :
Self-Synchronization Strings in Huffman Equivalent Codes
Author_Institution :
Deptartment of Electrical Engineering, The University of Mississippi, University, MS 38677. Email: lcao@olemiss.edu
Abstract :
Possession of self-synchronization strings (SSSs) is a favorable feature of Huffman equivalent codes. In this paper, first, we show that SSSs in a Huffman equivalent code are in fact codewords or concatenation of codewords and then give a method to find those short SSSs without exhaustive search. Second, we present a closed-form solution to show how often the SSSs can be encountered in a coded sequence.
Keywords :
Binary codes; Binary trees; Closed-form solution; Decoding; Entropy;
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
Conference_Location :
Punta del Este, Uruguay
Print_ISBN :
1-4244-0035-X
Electronic_ISBN :
1-4244-0036-8
DOI :
10.1109/ITW.2006.322836
