Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts (1997)
| Venue: | Information Retrieval |
| Citations: | 10 - 4 self |
BibTeX
@ARTICLE{Klein97skeletontrees,
author = {Shmuel T. Klein},
title = {Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts},
journal = {Information Retrieval},
year = {1997},
volume = {3},
pages = {7--23}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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(log 2 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. The basic idea is then generalized, yielding further savings. This is an extended version of a paper which has been presented at the 8th Annual Symposium on Combinatorial Pattern Matching (CPM'97), and appeared in its proceedings, pp. 65--75. -- 1 -- 1.
