loading...
Fast Decoding of Prefix Encoded Texts
Snowbird, Utah March 29-March 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2005.39Data Compression Conference (DCC'05)
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Eyal Bergman, Shmuel T. Klein, "Fast Decoding of Prefix Encoded Texts," Data Compression Conference, pp. 143-152, Data Compression Conference (DCC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2005.39,
author = {Eyal Bergman and Shmuel T. Klein},
title = {Fast Decoding of Prefix Encoded Texts},
journal ={Data Compression Conference},
volume = {0},
year = {2005},
issn = {1068-0314},
pages = {143-152},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2005.39},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Fast Decoding of Prefix Encoded Texts
SN - 1068-0314
SP143
EP152
A1 - Eyal Bergman,
A1 - Shmuel T. Klein,
PY - 2005
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Eyal Bergman, Bar Ilan University, Israel
Shmuel T. Klein, Bar Ilan University, Israel
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.
Citation:
Eyal Bergman, Shmuel T. Klein, "Fast Decoding of Prefix Encoded Texts," dcc, pp.143-152, Data Compression Conference (DCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.