Enumeration and Coding of Compact Code Trees for Binary AIFV Codes
Enumeration and Coding of Compact Code Trees for Binary AIFV Codes
复制标题
二进制 AIFV 代码的紧凑代码树的枚举和编码
DOI：
10.1109/isit.2019.8849775
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Hirosuke Yamamoto
中科院分区：
文献类型：
--
作者：
Kengo Hashimoto;Ken-ichi Iwata;Hirosuke Yamamoto
我们将霍夫曼码的紧凑码树，即规范码树的概念扩展到二进制AIFV（几乎瞬时固定到可变长度）码的情况。利用紧化AIFV码树与本文定义的适当序列之间的双射，给出了一种枚举所有紧化AIFV码树数目的算法。在压缩AIFV编码树枚举的基础上，给出了一种高效的压缩AIFV编码树描述方案，用于向解码器发送编码源序列所需的编码树信息。
We extend the concept of compact code trees, i.e., canonical code trees, of Huffman codes to the case of binary AIFV (almost instantaneous fixed-to-variable length) codes. We give an algorithm to enumerate the number of all compact AIFV code trees by using a bijection between the compact AIFV code trees and the proper sequences defined in this paper. Based on the enumeration of compact AIFV code trees, we give an efficient coding scheme to describe the compact AIFV code trees, which is required when we send a decoder the information of code trees used in the encoding of source sequences.