Huffman coding is a coding technique for lossless compression of data base based upon the frequency of occurance of a symbol in that file.
In huffman coding every Data is based upon 0’s and 1’s which reduces the size of file.
Using binary representation, the number of bits required to represent each character depends upon the number of characters that have to be represented. Using one bit we can represent two characters, i.e., 0 represents the first character and 1 represents the second character.
Click Below for More – –
C#ODE Studio 