Documente Academic
Documente Profesional
Documente Cultură
Assignment # 6
Assignment # 6
Huffman coding
Instructor:
Sir Qasim Umer Khan
2
Assignment # 6
Information is the original data its size is 21 bits long. final_data is the Huffman
compressed data its size is greatly reduced to 10 as M=8 ,k=3 in this case quite
similar data
7
Assignment # 6
Now in this window it is shown that final data Huffman encoded data when sent to the decoding functions return the original
data and the sum(ol==information) returns 21 which means all 21 bits of original data and decoded data are a match.
IV. CONCLUSION
Now the implementation of the Huffman lossless entropy
encoding compression algorithm has confirmed the notion that
when data has many similar elements in it this compression
reduces the length of a code and hence increases the entropy
no of useful information sent per bits.