Skip to content

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 …

License

Notifications You must be signed in to change notification settings

HxnDev/Huffman-Data-Encryption

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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 : chhxnshah@gmail.com

About

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 …

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published