Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source