Self-Synchronization Strings in Huffman Equivalent Codes

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.