Description:

The objective of this programme is to compress and decompress ASCII text files using huffman compression method. To do so, a huffman tree is created based on original file character frequency and a compressed file (*.huff) is genereated based on the huffman tree. Finally, an uncompressed file (*.unhuff) is generated by re-creating the huffman tree and decoding the text content of the compressed file.
Project report available here. || Link to github repository here.

My learning experience

Huffman Tree definition
- Create a huffman tree given a source file
- Ecode characters based on their relative position to root
Compression of file
- Design and Create header for compressed file based on huffman tree
- Encode header and main content bit-by-bit
Decompression of compressed file
- Read header of compressed file and generate huffman tree based on header information
- Traverse huffman tree until end of main content to decode the same

Some challenges faced

Challenges faced

Designing of suitable header file that would take least space and be simple to use.
Writing and reading of the compressed file on a bit-by-bit basis and creating the huffman tree during decompression based on the header information provided.

Huffman coding

Description:

My learning experience

Some challenges faced

Challenges faced

Some Pics