最优二元AIFV码及其扩展码的最坏情况冗余
Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes
摘要:
二进制AIFV码是无损码,它推广了瞬时FV码。该代码使用两个代码树,并将源符号分配给不完整的内部节点以及叶子。经验表明,AIFV码比霍夫曼码具有更好的压缩比。然而,关于最佳二进制AIFV码的冗余的上界仅已知为1,这与霍夫曼码的界相同。本文将其上界改进为1/2,这与码的最坏情况冗余度相吻合。与此同时,根据$p_{\max}\geq$ 1/2导出最坏情况的冗余,其中$p_{\max}$是最可能的源符号的概率。此外,我们提出了一种扩展的二进制AIFV码,它使用$m$码树,并允许最多$m$位解码延迟。我们证明了对于$m \leq 4.$,扩展二进制AIFV码的最坏情况冗余是$1/m$
英文摘要:
Binary AIFV codes are lossless codes that generalize the class of instantaneous FV codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy is derived in terms of $p_{\max}\geq$1/2, where $p_{\max}$ is the probability of the most likely source symbol. Additionally, we propose an extension of binary AIFV codes, which use $m$ code trees and allow at most $m$-bit decoding delay. We show that the worst-case redundancy of the extended binary AIFV codes is $1/m$ for $m \leq 4.$
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。