霍夫曼编码是一种编码方式，是一种用于无损数据压缩的熵编码（权编码）算法。用变长编码表对源符号（如文件中的一个字母）进行编码，其中变长编码表是通过一种评估来源符号出现机率的方法得到的，出现机率高的字母使用较短的编码，反之出现机率低的则使用较长的编码，这便使编码之后的字符串的平均长度、期望值降低，从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding) for the algorithm. With variable-length coding tables on the source symbol (such as a file in a letter) to encode, which is a method of variable length coding table through an assessment of the probability of occurrence of the source symbols obtained letters appear high probability using a shorter code, and vice versa low appears machine code using a longer, which would make the average length of the string after encoding, expectations are lower, so as to achieve the purpose of lossless data compression.