Huffman Coding

Huffman coding is a kind of lossless data compression method. It encodes symbol which has highest occurence frequency to shortest code length, and encodes symbol which has lowest occurence frequency to longest code length.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License