Space- and time-efficient decoding with canonical huffman trees: Extended abstract

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

14 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings
EditorsAlberto Apostolico, Alberto Apostolico, Jotun Hein
PublisherSpringer Verlag
Pages65-75
Number of pages11
ISBN (Print)9783540632207
DOIs
StatePublished - 1997
Event8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark
Duration: 30 Jun 19972 Jul 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1264
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997
Country/TerritoryDenmark
CityAarhus
Period30/06/972/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

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

Cite this