霍夫曼編碼（Huffman Coding）是一種編碼方式，是一種用於無損數據壓縮的熵編碼（權編碼）算法。 在計算機數據處理中，霍夫曼編碼使用變長編碼表對源符號（如文件中的一個字母）進行編碼，其中變長編碼表是通過一種評估來源符號出現機率的方法得到的，出現機率高的字母使用較短的編碼，反之出現機率低的則使用較長的編碼，這便使編碼之後的字符串的平均長度、期望值降低，從而達到無損壓縮數據的目的。-Huffman coding (Huffman Coding) is an encoding, data compression is a lossless entropy coding (right encoding) algorithm is used. Computer data processing, Huffman encoding uses variable length coding table source symbols (such as a file in a letter) is encoded, wherein the variable length coding table is a method of assessing the probability of occurrence by source symbols obtained appear high probability letters using a shorter code, otherwise the machine appears low use longer codes, which would make the average length of the string after encoding, reducing expectations, so as to achieve the purpose lossless data compression.