哈夫曼压缩算法编码是无损压缩当中最好的方法。它使用预先二进制描述来替换每个符号，长度由特殊符号出现的频率决定。常见的符号需要很少的位来表示，而不常见的符号需要很多为来表示。
　　哈夫曼算法在改变任何符号二进制编码引起少量密集表现方面是最佳的。然而，它并不处理符号的顺序和重复或序号的序列。(Huffman compression algorithm coding is the best method of lossless compression. It replaces each symbol with a prebinary descr iption, and the length is determined by the frequency of the particular symbol. Common symbols require a very small number of bits to represent, and less common symbols require a lot of representation.
The Huffman algorithm is optimal for changing any symbol binary encoding to cause a small amount of intensive performance. However, it does not deal with the sequence of symbols and repeats or sequence Numbers.)