【摘要】 霍夫曼码是Huffman在1952年提出的一种最优不等长码,在通信、信号处理等许多领域都有广泛应用。文中研究了离散无记忆二进信源的n阶扩展源的霍夫曼码平均冗余量问题,对WojciechSzpankowski提出的精确渐近结果给出了一种新的证明方法。这种证明所采用的数学方法在信息论及其他有关渐近问题的相关工程学科中都是极有意义的。更多还原

【Abstract】 Huffman codes are a kind of optimum fixed-to-variable length codes proposed by Huffman in 1952. They have found wide applications in communication, signal processing and many other fields. The average redundancy problems on Huffman block codes in a discrete memoryless binary source generating a sequence of length n is studied and a new prove method of a precise asymptotic result is given. The mathematical methods used for proving are of significance to information theory and other related fields about asymptotic performance.更多还原