论文信息 - Huffman's Algorithm via Algebra

Huffman's Algorithm via Algebra

Abstract : The well known algorithm of David A. Huffman for finding minimum redundancy codes has found many diverse applications, and in recent years it has been extended in a variety of ways. The purpose of this note is to discuss simple algebraic approach that seems to fit essentially all of the applications of Huffman's method that are presently known. (Author)

Donald E. Knuth

[1] T. C. Hu,et al. BINARY TREES OPTIMUM UNDER VARIOUS CRITERIA , 1979 .

[2] Jan van Leeuwen,et al. On the Construction of Huffman Trees , 1976, ICALP.

[3] Alon Itai,et al. Optimal Alphabetic Trees , 1976, SIAM J. Comput..

[4] Richard M. Karp,et al. On the Optimality of Huffman Trees , 1976 .

[5] F. K. Hwang. Generalized Huffman Trees , 1979 .

[6] Lawrence T. Kou. Minimum Variance Huffman Codes , 1982, SIAM J. Comput..

[7] Eugene S. Schwartz,et al. An Optimum Encoding with Minimum Longest Code and Total Number of Digits , 1964, Inf. Control..

[8] Martin Charles Golumbic. Combinatorial Merging , 1976, IEEE Transactions on Computers.

[9] Douglas Stott Parker,et al. Conditions for Optimality of the Huffman Algorithm , 1998, SIAM J. Comput..

[10] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[11] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .