A new data structure is investigated, which allows fast decoding of texts encoded by canonical Huffman codes. The storage requirements axe 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.
|Title of host publication||Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings|
|Editors||Alberto Apostolico, Alberto Apostolico, Jotun Hein|
|Number of pages||11|
|State||Published - 1997|
|Event||8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark|
Duration: 30 Jun 1997 → 2 Jul 1997
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997|
|Period||30/06/97 → 2/07/97|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.