Huffman~*:improved huffman data compression algorithm
Sifeng Liu · Computer Engineering and Applications Journal · 2007
A data compression algorithm named Huffman based on Huffman is presented in this paper.The improvements can be generalized two aspects.The fist is about the overflow of code,which is linear link,and the second improvement is a heap sort algorithm,which needs a few times in reading main memory and advances the responsed speed.Finally,we use three documents of JPG to show the promising experimental results compared with the classical Huffman algorithm.It proves the compression algorithm is less than the classical algorithm.