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.

作者: Lei Cao

作者单位: Deptartment of Electrical Engineering The University of Mississippi, University, MS 38677

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 347-350

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）