Variable-length-to-variable-length source coding: A greedy step-by-step algorithm
Variable-length-to-variable-length source coding: A greedy step-by-step algorithm
复制标题
变长到变长源编码：贪心逐步算法
DOI：
10.1109/18.149517
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
Francesco Fabris
中科院分区：
文献类型：
--
作者：
Francesco Fabris
给出了变长到变长信源编码的一些结果。给出了一般V-V码渐近最优性的一个充分判据。这也使得研究Tunstall-Huffman方案的性能成为可能。然后，基于信息散度伪度量和与信源概率分布后续扩展相关的当前速率的Gallager算法最小化，描述了前缀编码的一种非最优贪婪方法。虽然并不总是达到最优，但这种技术可以有效地用于改善Tunstall-Huffman级联。>；
Some results on variable-length-to-variable-length source coding are presented. A sufficient criterion for the asymptotic optimality of the generic V-V code is given. This also allows the study of the Tunstall-Huffman scheme performance. Then, a nonoptimal greedy approach to prefix codes is described, based on the informational divergence pseudometric and on the Gallager algorithm minimization of the current rate, associated with the subsequent extensions of the source probability distribution. Although optimality is not always reached, this technique can be usefully employed to improve the Tunstall-Huffman concatenation. >