关键词: 编码, 数据压缩, Huffman

Abstract: 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 few times in reading main memory. Finally, we show the promising experimental results compared with the classical Huffman algorithm.

Key words: coding, data compression, Huffman