The project is to design compression and decompression programs using Huffman Coding. The idea is to assign variable length codes to input characters based on their frequencies. The more the frequency of the character the shorter the code assigned to it. To reduce the weighted expected storage by means of assigning shorter codes to frequently occurring characters.
➡ Provide the input.
➡ Note the frequency of all the characters in the input.
➡ Construct a min priority queue with respect to the frequencies of the characters.
➡ Construct Huffman Tree from the priority queue.
➡ Encode the file, store the encoding table and compress the input based on the encoding table.
The codes are stored as bits and each character is provided a prefix code which is a string of bits.
➡ Open the file and reconstruct the Huffman Tree based on the encoded table.
➡ Decode the file and store it into the desired file.
➡ A compression varying from 6-7% of the initial input is achieved.
➡ An output consisting of Original string, Encoded string, Decoded string and Compression rate has been generated.
