Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a
synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is
an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest
possible number of code symbols per source symbol [7]. In this paper, the Lossless method of compression and
decompression is proposed using a simple coding technique called Huffman coding which is used on text string as
well as on different image file formats for performance analysis. The results reveals that the original image used
for coding is almost close to the decoded output image.