Space-and time-efficient decoding with canonical huffman trees

S. Klein

Space-and time-efficient decoding with canonical huffman trees

S. Klein

Department of Computer Science and Artificial Intelligence

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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(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 language	American English
Title of host publication	Annual Symposium on Combinatorial Pattern Matching
Editors	Alberto Apostolico, Jotun Hein
Publisher	Springer Berlin Heidelberg
State	Published - 1997

Bibliographical note

Place of conference:Denmark

Cite this

@inproceedings{098cd63718ec4279a10bbcf3608a8b35,

title = "Space-and time-efficient decoding with canonical huffman trees",

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(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.",

author = "S. Klein",

note = "Place of conference:Denmark",

year = "1997",

language = "American English",

editor = "Alberto Apostolico and Jotun Hein",

booktitle = "Annual Symposium on Combinatorial Pattern Matching",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Space-and time-efficient decoding with canonical huffman trees

AU - Klein, S.

N1 - Place of conference:Denmark

PY - 1997

Y1 - 1997

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(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.

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(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.

UR - https://scholar.google.co.il/scholar?q=Space+and+time-efficient+decoding+with+canonical+Huffman+trees%2C&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Annual Symposium on Combinatorial Pattern Matching

A2 - Apostolico, Alberto

A2 - Hein, Jotun

PB - Springer Berlin Heidelberg

ER -

Space-and time-efficient decoding with canonical huffman trees

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this