GitHub / HxnDev / Huffman-Encoding-Using-Binary-Trees
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 but because they’re less frequent it won’t matter that much.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FHuffman-Encoding-Using-Binary-Trees
PURL: pkg:github/HxnDev/Huffman-Encoding-Using-Binary-Trees
Stars: 4
Forks: 0
Open issues: 0
License: mit
Language: C++
Size: 413 KB
Dependencies parsed at: Pending
Created at: about 4 years ago
Updated at: over 2 years ago
Pushed at: almost 4 years ago
Last synced at: 3 months ago
Topics: algorithm, binary-search-tree, binary-tree, compression, compression-algorithm, cpp, decryption, encoding, encryption, huffman, vecctor, visual-studio