loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC'05)
Implementation Cost of the Huffman-Shannon-Fano Code
Snowbird, Utah
March 29-March 31
ISBN: 0-7695-2309-9
ASCII Text
x 
 
Tjalling Tjalkens, "Implementation Cost of the Huffman-Shannon-Fano Code," Data Compression Conference, pp. 123-132, Data Compression Conference (DCC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2005.44,
author = {Tjalling Tjalkens},
title = {Implementation Cost of the Huffman-Shannon-Fano Code},
journal ={Data Compression Conference},
volume = {0},
year = {2005},
issn = {1068-0314},
pages = {123-132},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2005.44},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Implementation Cost of the Huffman-Shannon-Fano Code
SN - 1068-0314
SP123
EP132
A1 - Tjalling Tjalkens,
PY - 2005
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Tjalling Tjalkens, Eindhoven University of Technology, The Netherlands
An efficient implementation of a Huffman code can be based on the Shannon-Fano construction. An important question is exactly how complex is such an implementation. In the past authors have considered this question assuming an ordered source symbol alphabet. In the case of the compression of blocks of binary symbols this ordering must be performed explicitly and it turns out to be the complexity bottleneck.
Citation:
Tjalling Tjalkens, "Implementation Cost of the Huffman-Shannon-Fano Code," dcc, pp.123-132, Data Compression Conference (DCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.