Alphabetic AIFV Codes Constructed from Hu-Tucker codes
Alphabetic AIFV Codes Constructed from Hu-Tucker codes
复制标题
由 Hu-Tucker 代码构建的按字母顺序排列的 AIFV 代码
DOI：
10.1109/isit.2018.8437915
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Hirosuke Yamamoto
中科院分区：
文献类型：
--
作者：
Tomotaka Hiraoka;Hirosuke Yamamoto
字母代码是这样的代码：码字序列的顺序与源序列的字母顺序一致。如果使用一棵码树，则可以通过Hu-Tucker算法构造出平均码长最小的最优字母码。在本文中，我们证明了可以通过使用三个码树并允许最多两位解码延迟来构造高效的字母AIFV（几乎瞬时固定到可变长度）码，并且我们提出了一种从Hu-Tucker码树构造字母AIFV码的简单方法，使得字母AIFV码可以获得比Hu-Tucker码更好的压缩率。
An alphabetic code is a code such that the order of codeword sequences coincides with the alphabetic order of source sequences. If we use one code tree, the optimal alphabetic code attaining the minimum average code length can be constructed by the Hu-Tucker algorithm. In this paper, we show that an efficient alphabetic AIFV (almost instantaneous fixed-to-variable length) code can be constructed by using three code trees and allowing at most two-bit decoding delay, and we propose a simple method to construct an alphabetic AIFV code from the Hu- Tucker code tree so that the alphabetic AIFV code can attain better compression rate than the Hu- Tucker code.