Donald E. Knuth
Index Terms
Dynamic Huffman coding
Recommendations
Huffman Coding
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it ...
Forward Looking Huffman Coding
AbstractHuffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n ...
Reviews
Charles J. Colbourn
A representation for a Huffman tree is developed which enables the increase or decrease of any weight at level :6J by one in time O(:6J), preserving minimality of weighted path length. A real-time, one-pass compression scheme can be based on this representation. The paper is very well written, and explicitly defines all data structures and algorithms used. A large empirical evaluation is also reported.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments