loading...
Huffman Coding with Non-sorted Frequencies
March 25-March 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2008.73Data Compression Conference (dcc 2008)
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file. In an application to packet transmission, using partial order may even improve the compressibility.
Index Terms:
Huffman coding, non-sorted frequencies, compression efficiency
Citation:
Shmuel T. Klein, Dana Shapira, "Huffman Coding with Non-sorted Frequencies," dcc, pp.526, Data Compression Conference (dcc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.