DocumentCode :
3226758
Title :
Huffman Coding with Non-sorted Frequencies
Author :
Klein, Shmuel T. ; Shapira, Dana
Author_Institution :
Bar Ilan Univ., Ramat Gan
fYear :
2008
fDate :
25-27 March 2008
Firstpage :
526
Lastpage :
526
Abstract :
A standard way of implementing Huffman´s optimal code construction algorithm is by using a sorted sequence of frequencies. Using only partial order may speed up the code construction, which is important in some applications, at the cost of possibly increasing the size of the encoded file.
Keywords :
Huffman codes; block codes; computational complexity; data compression; sequences; Huffman coding; Huffman optimal code construction; nonsorted frequencies; sorted sequence; Application software; Code standards; Computer science; Costs; Data compression; Educational institutions; Frequency estimation; Gallium nitride; Huffman coding; Markov processes; Huffman coding; compression efficiency; non-sorted frequencies;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2008. DCC 2008
Conference_Location :
Snowbird, UT
ISSN :
1068-0314
Print_ISBN :
978-0-7695-3121-2
Type :
conf
DOI :
10.1109/DCC.2008.73
Filename :
4483353
Link To Document :
بازگشت