Abstract
A new data structure is investigated, which allows fast decoding of texts encoded by canonical Huffman codes. The storage requirements are much lower than for conventional Huffman trees, O(log2 n) for trees of depth O(log n), and decoding is faster, because a part of the bit-comparisons necessary for the decoding may be saved. Empirical results on large real-life distributions show a reduction of up to 50% and more in the number of bit operations.
Original language | American English |
---|---|
Title of host publication | Annual Symposium on Combinatorial Pattern Matching |
Editors | Alberto Apostolico, Jotun Hein |
Publisher | Springer Berlin Heidelberg |
State | Published - 1997 |