https://github.com/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.
https://github.com/hxndev/huffman-data-encryption
coding compression cpp decipher decoding decryption encoding encryption huffman huffman-algorithm huffman-coding huffman-compression-algorithm queue tree vector
Last synced: about 1 month ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/hxndev/huffman-data-encryption
- Owner: HxnDev
- License: mit
- Created: 2021-06-22T13:49:53.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2021-08-14T06:27:12.000Z (over 3 years ago)
- Last Synced: 2023-03-04T18:38:10.171Z (about 2 years ago)
- Topics: coding, compression, cpp, decipher, decoding, decryption, encoding, encryption, huffman, huffman-algorithm, huffman-coding, huffman-compression-algorithm, queue, tree, vector
- Language: C++
- Homepage:
- Size: 700 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0