哈夫曼码、紧树和单位分数和的个数
The number of Huffman codes, compact trees, and sums of unit fractions
摘要:
长度为r的霍夫曼码在长度为t的字母表上的“非等价”霍夫曼码的数量已经被频繁地研究。等价地,“不等价”的完全t-叉树的数量已经被检查。我们首先调查文献,统一几个独立的方法来解决这个问题。然后,改进以前的工作,我们证明了一个非常精确的渐近结果的计数函数,包括两个主要的条款和一个错误的条款。
英文摘要:
The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying several independent approaches to the problem. Then, improving on earlier work we prove a very precise asymptotic result on the counting function, consisting of two main terms and an error term.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。