Coding of ordered trees
Coding of ordered trees
复制标题
有序树的编码
DOI：
10.1109/isit.2000.866305
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
M. Hoshi
中科院分区：
文献类型：
--
作者：
K. Kobayashi;H. Morita;M. Hoshi
我们研究有序树木的渐近生长，并从信息理论观点中对树木编码进行重要见解。具体而言，我们从牛皮纸不等式满足平等的意义上给出了最佳长度函数。据揭示，特殊树木的常用预订编码在渐近上是渐近的，但并不总是针对许多树木。
We study the asymptotic growth of ordered trees, and give important insights in coding of trees from the information theoretic viewpoint. Specifically, we give the optimal length function in a sense that the Kraft inequality is satisfied with equality. It is revealed that the commonly used pre-order coding for special classes of trees are asymptotically tight, but not always for many trees.