Huffman coding is entropy encoding algorithm used for lossless data compression. It basically uses variable length coding which is done using binary tree method. In our implementation of Huffman encoder, more frequent input data is encoded with less number of binary bits than the data with less frequency.This way of coding is used in JPEG and MPEG for image compression. Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code. Prefix-free

more »

... codes means the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol.