Abstract

Abstract. A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-pass algorithm due to Failer, Gallager, and Knuth. In each algorithm, both the sender and the receiver maintain equivalent dynamically varying Huffman trees, and the coding is done in real time. We show that the number of bits used by the new algorithm to encode a message containing t letters is < t bits more than that used by the conventional two-pass Huffman scheme, independent of the alphabet size. This is best possible in the worst case, for any one-pass Huffman method. Tight upper and lower bounds are derived. Empirical tests show that the encodings produced by the new algorithm are shorter than those of the other one-pass algorithm and, except for long messages, are shorter than those of the two-pass method. The new algorithm is well suited for on-line encoding/decoding in data networks and for file compression.

Citations

773	A method for the construction of minimum-redundancy codes - Huffman - 1952
128	A Locally Adaptive Data Compression Scheme - Bentley, Sleator, et al. - 1986
100	Variations on a theme by Huffman - Gallager - 1978
89	Dynamic Huffman coding - Knuth
36	An adaptive system for data compression - Faller - 1973
32	A method for the construction of minimum redundancy codes - man - 1952
17	An optimum encoding with minimum longest code and total number of digits - Schwartz - 1964
15	Variations on a theme by Hu man - Gallager - 1978
9	1987]. Design and Analysis of Coalesced Hashing - Vitter, Chen - 1987
9	Dynamic Hu man Coding - Knuth - 1985
2	Interval and Recency-Rank Source Coding: Two Online Adaptive VariableLength Schemes," IEEE Transactions on Information Theory (to appear). and Analysis of Dynamic Hu man - Elias - 1973
1	Documentation of the compact command - MCMASTER - 1984
1	Dynamic Huffman Coding - VIITER - 1986
1	Documentation of the Compact Command - Master - 1984
1	Analysis of Dynamic Huffman Codes / 37 - Design - 1973