hxndev / huffman-data-encryption

The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input, we want to encode the most frequent symbols will take less space than they used to and the least frequent symbols will take more space.

Huffman Data Encryption

All the files have been commented for your ease. Furthermore you may also add further comments if you may.

This was a group project and equal contribution was provided by my fellow team member Azka Khurram

For further queries contact me at : [email protected]