Space-and time-efficient decoding with canonical huffman trees

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageAmerican English
Title of host publicationAnnual Symposium on Combinatorial Pattern Matching
EditorsAlberto Apostolico, Jotun Hein
PublisherSpringer Berlin Heidelberg
StatePublished - 1997

Bibliographical note

Place of conference:Denmark


Dive into the research topics of 'Space-and time-efficient decoding with canonical huffman trees'. Together they form a unique fingerprint.

Cite this