具有较少相异码字的最佳前缀码构造速度更快
Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct
摘要：
本文提出了一种构造最小冗余二元前缀码的新方法。我们的方法不显式地构建霍夫曼树，而是使用最优前缀码的属性来计算与输入权重相对应的码字长度。令$n$为权重的数目，而$k$为由用于最佳码的算法产生的不同码字长度的数目。我们的算法的运行时间是$O(k \cdot n)$。根据我们以前在\cite{be}中的工作，没有算法可能在$o(k \cdot n)$时间内构造最优前缀码。当给定的权重被预排序时，我们的算法执行$O(9^k \cdot \log^{2k}{n})$比较。
英文摘要：
A new method for constructing minimum-redundancy binary prefix codes is described. Our method does not explicitly build a Huffman tree; instead it uses a property of optimal prefix codes to compute the codeword lengths corresponding to the input weights. Let $n$ be the number of weights and $k$ be the number of distinct codeword lengths as produced by the algorithm for the optimum codes. The running time of our algorithm is $O(k \cdot n)$. Following our previous work in \cite{be}, no algorithm can possibly construct optimal prefix codes in $o(k \cdot n)$ time. When the given weights are presorted our algorithm performs $O(9^k \cdot \log^{2k}{n})$ comparisons.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
