Fast decoding of prefix encoded texts

Eyal Bergman; Shmuel T. Klein

Fast decoding of prefix encoded texts

Eyal Bergman
, Shmuel T. Klein

Department of Computer Science

Bar-Ilan University

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

Abstract

New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman's. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.

Original language	English
Pages (from-to)	143-152
Number of pages	10
Journal	Data Compression Conference Proceedings
State	Published - 2005
Event	DCC 2005: Data Compression Conference - Snowbird, UT, United States Duration: 29 Mar 2005 → 31 Mar 2005

Cite this

@article{a621b3318bd24249a6f4b7b5120cce97,

title = "Fast decoding of prefix encoded texts",

abstract = "New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman's. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.",

author = "Eyal Bergman and Klein, \{Shmuel T.\}",

year = "2005",

language = "אנגלית",

pages = "143--152",

journal = "Data Compression Conference Proceedings",

issn = "1068-0314",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "DCC 2005: Data Compression Conference ; Conference date: 29-03-2005 Through 31-03-2005",

}

TY - JOUR

T1 - Fast decoding of prefix encoded texts

AU - Bergman, Eyal

AU - Klein, Shmuel T.

PY - 2005

Y1 - 2005

N2 - New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman's. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.

AB - New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman's. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.

UR - https://www.scopus.com/pages/publications/26944476665

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:26944476665

SN - 1068-0314

SP - 143

EP - 152

JO - Data Compression Conference Proceedings

JF - Data Compression Conference Proceedings

T2 - DCC 2005: Data Compression Conference

Y2 - 29 March 2005 through 31 March 2005

ER -

Fast decoding of prefix encoded texts

Abstract

Other files and links

Fingerprint

Cite this