On the construction of statistically synchronizable codes
Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro · IEEE Transactions on Information Theory · 1992
The problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source is considered. It is shown how to efficiently construct a statistically synchronizable code whose average codeword length is within the least likely codeword probability from that of the Huffman code for the same source. Moreover, a method is given for constructing codes having a synchronizing codeword. The method yields synchronous codes that exhibit high synchronizing capability and low redundancy.>