Huffman Encode
Huffman code is a specific type of optimal prefix code that is commonly used for lossless data compression. The algorithm was developed by David A. Huffman while he was a Sc.D. student at MIT and was published in 1952.
The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol. The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols.
The simplest construction...
You should be an authorized user in order to see the full description and start solving this mission.
