arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2001.11170cs.ITcs.CGmath.IT
收藏

构造最优二元AIFV码的多项式时间算法

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-$2$ Codes

Mordecai Golin, Elfarouk Harb

摘要:

Huffman码是一种最优的瞬时固定到可变(FV)码,其中每个源符号只能由一个码字编码。放松这些限制允许构建更好的FV代码。更具体地说,最近的工作表明,AIFV- $m$码可以击败霍夫曼编码。AIFV- $m$码构造不同编码树的一个$m$ -元组,码在所述不同编码树之间交替并且仅是几乎瞬时的(AI)。这意味着解码一个字可能需要有限位数的延迟。当前用于构造最优AIFV- $m$码的算法是构造码树的渐进“更好集合”的迭代过程。该过程已被证明是收敛到最佳的代码,但没有已知的收敛速度的界限。本文推导了二进制AIFV- $2$码空间的几何解释,从而可以发展构造最优AIFV码的第一个多项式时间有界迭代过程。我们首先表明,一个简单的二叉搜索过程可以取代目前的迭代过程,以构建最佳的二进制AIFV- $2$码。然后,我们描述了如何框架的问题作为一个线性规划的指数数量的约束,但多项式时间可分性预言。这允许使用Grötschel,Lovász和Schrijver椭球方法来解决问题的多项式步骤。虽然更复杂,但第二种方法有可能导致多项式时间算法来构造用于一般$m$的最佳AIFV- $m$码。

英文摘要:

Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these constraints permits constructing better FV codes. More specifically, recent work has shown that AIFV-$m$ codes can beat Huffman coding. AIFV-$m$ codes construct am $m$-tuple of different coding trees between which the code alternates and are only almost instantaneous (AI). This means that decoding a word might require a delay of a finite number of bits. Current algorithms for constructing optimal AIFV-$m$ codes are iterative processes that construct progressively "better sets" of code trees. The processes have been proven to finitely converge to the optimal code but with no known bounds on the convergence rate. This paper derives a geometric interpretation of the space of binary AIFV-$2$ codes, permitting the development of the first polynomially time-bounded iterative procedures for constructing optimal AIFV codes. We first show that a simple binary search procedure can replace the current iterative process to construct optimal binary AIFV-$2$ codes. We then describe how to frame the problem as a linear programming with an exponential number of constraints but a polynomial-time separability oracle. This permits using the Grötschel, Lovász and Schrijver ellipsoid method to solve the problem in a polynomial number of steps. While more complicated, this second method has the potential to lead to a polynomial time algorithm to construct optimal AIFV-$m$ codes for general $m$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑