Design and Analysis of Dynamic Huffman Codes （设计和分析的动态霍夫曼编码）.pdfVIP

Design and Analysis of Dynamic Huffman Codes JEFFREY SCOTT VITTER Brown University, Providence, Rhode Island Abstract. A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-passalgorithm 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 messagecontaining 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. Categories and Subject Descriptors: C.2.0 [Computer-Communication Networks]: General-data com- munications; E.1 [Data]: Data Structures-trees; E.4 [Data]: Coding and Information Theory-data compaction and compression; nonsecretencoding schemes; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems; G.2.2 [Discrete Mathematics]: Graph Theory- trees; H. 1.I [Models and Principles]: Systems and Information Theory-value of information General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases:Distributed computing,