A quick and easy way to compress your files.
_ _ __ __ _____ _ _
| | | | / _|/ _| / ____| | (_)
| |__| |_ _| |_| |_ _ __ ___ __ _ _ __ | | ___ __| |_ _ __ __ _
| __ | | | | _| _| '_ ` _ \ / _` | '_ \ | | / _ \ / _` | | '_ \ / _` |
| | | | |_| | | | | | | | | | | (_| | | | | | |___| (_) | (_| | | | | | (_| |
|_| |_|\__,_|_| |_| |_| |_| |_|\__,_|_| |_| \_____\___/ \__,_|_|_| |_|\__, |
__/ |
|___/
| Encoding File | Decoding File |
|---|---|
 |
 |
Must have Python3 installed or the ability to run .exe .
Operating Systems: Windows, Linux, Mac
There are a couple ways to download the compression application:
- Download the zip
- Clone the repo:
git clone https://github.com/jacobhallberg/HuffmanCompression.git
To Run type:
$ python3 encode.py
Or run the .exe directly.
A Huffman Coding counts the frequencies of each character and creates binary codes decreasing in length for the characters with higher frequency. After encoding the file, a corresponding codebook is needed to decode the file providing space savings and privacy for the user with the codebook.
input_string = "Hello"
frequency_dictionary = {'H': 1, 'e': 1, 'l': 2, 'o': 1}
Create a min heap priority queue and continue to pop off two of the least frequent nodes, conjoin the two nodes and insert them back into the priority queue until only one element remains in the heap. This last element is the Huffman Tree.
('Helo' : 5)
0/ \1
('He': 2) ('lo': 3)
0/ \1 /0 \1
('H': 1)('e': 1) ('l': 2)('o': 1)
Afterwords create a coding by following the above tree and assigning zeros to each left path and ones to each right path until a leaf node is found. Concat these zeros and ones for each character to create a binary encoding.
coding = {'H': 00, 'e': 01, 'l': 10, '0': 11}
Use the coding to encode each character in the original string.
encoded_string = "0001101011"
For more information, please refer to the Wikipedia Page.
MIT License - see the LICENSE file for more details.
- Theoretical Encoding Limit: https://en.wikipedia.org/wiki/Entropy_(information_theory)
- Huffman Encoding Algorithm: https://www.geeksforgeeks.org/greedy-algorithms-set-3-huffman-coding/
Copyright (c) 2017 Jacob Hallberg