HUFFMANS CODING

Huffman coding is an entropy encoding algorithm used

for lossless data compression
ENTROPY refers to the quantization of the
unpredictability of the system
The term refers to the use of a variable-length code
table for encoding a source symbol (such as a character
in a file)
the variable-length code table has been derived in a
particular way based on the estimated probability of
occurrence for each possible value of the source
symbol.
The running time of Huffman's method is
fairly efficient, it takes O(n log n) operations
to construct it.
Based on binary tree which is a data
structure concept
APPLICATIONS
Used in mainstream compression formats
such as ZIP
Used in lossless compression formats PNG,GIF
Used as a back-end algorithm in encoding of
JPEG,MP3 formats
Is most widely used to encode text files
Widely applied in medical imaging and 3D
medical image compression