canonical-huffman-compression 0.1.1.2

A package for canonical Huffman compression

Canonical Huffman-Compression

I created this code because I wanted an implementation of the Huffman algorithm that I couldn't find in python. It uses canonical code and saves the Huffman code dictionary with a combination of sorted symbols and the number occurrences for each code length. This is ideal for situations where the number of symbols used is significantly smaller than the number of possible symbols.

In addition to the Huffman compression/decompression, it allows for the saving and loading of compressed files. The data input must be formatted as a list of integers.

TO USE: Start off with huffman_demo.py. I believe the implementation is fairly straightforward