Skip to content

A text encoder and decoder based on huffman text compression.

License

Notifications You must be signed in to change notification settings

ImSkully/huffman-tree-encoding

Repository files navigation

Huffman Tree Text Compression

License Repo Size Version

A text encoder and decoder based on huffman text compression. The output from the Huffman algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol.

Design Documentation

For a detailed overview of the full system design and specification, along with usability of all features that exist, refer to the Design Documentation available in the Wiki.