作者
Christopher F Freiling, Douglas S Jungreis, François Théberge, Kenneth Zeger
发表日期
2003/6/29
研讨会论文
IEEE International Symposium on Information Theory, 2003. Proceedings.
页码范围
49
出版商
IEEE
简介
All binary prefix codes, including Huffman codes, are "complete", in the sense that the vertices in their decoding trees are either leaves or have two children. An open question has been to characterize which prefix codes and which complete prefix codes have a self-synchronizing string. Various algorithms have been proposed for determining the self-synchronizing string. In this paper, we prove that almost all complete prefix codes have a self-synchronizing string.
学术搜索中的文章
CF Freiling, DS Jungreis, F Théberge, K Zeger - IEEE International Symposium on Information Theory …, 2003