论文部分内容阅读
在信源编码理论中，Ｔｕｎｓｔａｌｌ码是渐近最优的Ｖ－Ｂ码（Ｖ代表变长消息，Ｂ代表定长码字）．本文进一步研究了Ｔｕｎｓｔａｌｌ码的性质，给出了Ｔｕｎｓｔａｌｌ码的码率的新的上界，刻划了Ｔｕｎｓｔａｌｌ树和扩展次数之间的一些较深刻的内在联系，并且给出了一个寻找ε－最优的Ｔｕｎｓｔａｌｌ码的扩展次数的算法．
In the source coding theory, the Tunstall codes are asymptotically optimal V-B codes (V for variable-length messages and B for fixed-length codewords). In this paper, the properties of the Tunstall codes are further studied. A new upper bound of the code rate of the Tunstall codes is given. Some deep intrinsic relations between the Tunstall tree and the extension times are given. Algorithm for optimizing the number of Tunstall codes to expand.