TY - JOUR
T1 - Skeleton trees for the efficient decoding of huffman encoded texts
AU - Klein, Shmuel T.
PY - 2000
Y1 - 2000
N2 - 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(log2n) for trees of depth O(log n), and decoding is faster, because a part of the bit-comparisons necessary for the decoding maybe 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.
AB - 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(log2n) for trees of depth O(log n), and decoding is faster, because a part of the bit-comparisons necessary for the decoding maybe 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.
KW - Canonical huffman codes
KW - Decoding © 2000 kluwer academic publishers
KW - Huffman trees
KW - Skeleton trees
UR - http://www.scopus.com/inward/record.url?scp=0043122274&partnerID=8YFLogxK
U2 - 10.1023/A:1009910017828
DO - 10.1023/A:1009910017828
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0043122274
SN - 1386-4564
VL - 3
SP - 7
EP - 23
JO - Information Retrieval
JF - Information Retrieval
IS - 1
ER -