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

Shmuel T. Klein

doi:10.1007/3-540-63220-4_50

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

Shmuel T. Klein

CS@BIU

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

13 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(log² 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	English
Title of host publication	Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings
Editors	Alberto Apostolico, Alberto Apostolico, Jotun Hein
Publisher	Springer Verlag
Pages	65-75
Number of pages	11
ISBN (Print)	9783540632207
DOIs	https://doi.org/10.1007/3-540-63220-4_50
State	Published - 1997
Event	8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark Duration: 30 Jun 1997 → 2 Jul 1997

Publication series

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

Conference

Conference	8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997
Country/Territory	Denmark
City	Aarhus
Period	30/06/97 → 2/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access to Document

10.1007/3-540-63220-4_50

Cite this

Klein, S. T. (1997). Space- and time-efficient decoding with canonical huffman trees: Extended abstract. In A. Apostolico, A. Apostolico, & J. Hein (Eds.), Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings (pp. 65-75). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1264). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_50

Klein, Shmuel T. / Space- and time-efficient decoding with canonical huffman trees : Extended abstract. Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings. editor / Alberto Apostolico ; Alberto Apostolico ; Jotun Hein. Springer Verlag, 1997. pp. 65-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d2bac15a43464336a3820e01da8d42d1,

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

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

author = "Klein, {Shmuel T.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 ; Conference date: 30-06-1997 Through 02-07-1997",

year = "1997",

doi = "10.1007/3-540-63220-4_50",

language = "אנגלית",

isbn = "9783540632207",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "65--75",

editor = "Alberto Apostolico and Alberto Apostolico and Jotun Hein",

booktitle = "Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings",

address = "גרמניה",

}

Klein, ST 1997, Space- and time-efficient decoding with canonical huffman trees: Extended abstract. in A Apostolico, A Apostolico & J Hein (eds), Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1264, Springer Verlag, pp. 65-75, 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997, Aarhus, Denmark, 30/06/97. https://doi.org/10.1007/3-540-63220-4_50

Space- and time-efficient decoding with canonical huffman trees: Extended abstract. / Klein, Shmuel T.
Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings. ed. / Alberto Apostolico; Alberto Apostolico; Jotun Hein. Springer Verlag, 1997. p. 65-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1264).

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

TY - GEN

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

T2 - 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997

AU - Klein, Shmuel T.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

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

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

UR - http://www.scopus.com/inward/record.url?scp=84937441881&partnerID=8YFLogxK

U2 - 10.1007/3-540-63220-4_50

DO - 10.1007/3-540-63220-4_50

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84937441881

SN - 9783540632207

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 65

EP - 75

BT - Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings

A2 - Apostolico, Alberto

A2 - Hein, Jotun

PB - Springer Verlag

Y2 - 30 June 1997 through 2 July 1997

ER -

Klein ST. Space- and time-efficient decoding with canonical huffman trees: Extended abstract. In Apostolico A, Apostolico A, Hein J, editors, Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings. Springer Verlag. 1997. p. 65-75. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63220-4_50

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this