Application of Huffman Code

Huffman can be used in  compression formats that we might encounter like winrar winzip.These compression schemes have pathological data-sets that cannot be meaningfully compressed; the archive formats so huffman coding can be widely use in compression schemes.

Project Proposal

Project Name: 

Huff-Man Code

Project Description: 

In Computer science and Information theory, a Huffman code is an optimal prefix code found using algorithm developed by David A. Huffman. The process of finding or using the code is called “Huffman coding”. Huffman coding is a common technique in encoding.
The technique works by creating a binary tree of nodes. These can be stored in a regular array, the size of which depends on the number of symbol or alphabets.
 The process starts from leaf node. It is based on frequency of occurrence of a data item. The principle is to use a lower number of bits to encode the data that occurs more frequently. Codes are stored in a code Book which may be constructed for each image.