(Enter summary)
Abstract: We introduce and analyze a new one-pass algorithm
for constructing dynamic Huffman codes and also analyze the
one-pass algorithm due to Faller, 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,... (Update)
Similar documents based on text: More All
0.9: Dynamic Huffman Coding - Vitter (1989)
(Correct)
0.7: ALGORITHM 673 Dynamic Huffman Coding - Jeffrey Scott Vltter
(Correct)
0.4: Average-Case Analysis of Algorithms and Data Structures.. - Jeffrey Scott Vitter (1990)
(Correct)
Related documents from co-citation: More All
20: A Method for the Construction of Minimum Redundancy Codes (context) - Huffman - 1952
19: Dynamic Huffman coding (context) - Knuth - 1985
14: Variations on a theme by Huffman (context) - Gallager - 1978
BibTeX entry: (Update)
J. S. Vitter, "Design and Analysis of Dynamic Huffman Codes," Journal of the ACM 34 (Oct. 1987), 825--845. http://citeseer.ist.psu.edu/vitter87design.html More
@article{ vitter87design,
author = "Jeffrey Scott Vitter",
title = "Design and Analysis of Dynamic {Huffman} Codes",
journal = "Journal of the ACM",
volume = "34",
number = "4",
pages = "825--845",
year = "1987",
url = "citeseer.ist.psu.edu/vitter87design.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~jsv/Papers/catalog/node58.html):
XPathLearner: An On-Line Self-Tuning Markov.. - Lim, Wang.. (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC