Exploring Computer Hardware

Huffman Coding

Huffman coding is a lossless data compression algorithm based on the frequency of occurrence of a data item. Codes of different lengths are assigned to characters based on the frequency of occurrence. Smaller codes are assigned to characters that have the highest occurrence.

Lets look at an example. Let’s encode the string LEMMONS

First, create a table showing the frequency. Order the table by frequency from lowest to highest.

Now construct a Huffman tree. Create leaves for each of your characters using the table above.

Take the ...