https://github.com/imskully/huffman-tree-encoding

A text encoder and decoder based on huffman text compression.
https://github.com/imskully/huffman-tree-encoding

huffman-compression-algorithm java queues tree-structure

Last synced: 6 days ago
JSON representation

A text encoder and decoder based on huffman text compression.

• Host: GitHub
• URL: https://github.com/imskully/huffman-tree-encoding
• Owner: ImSkully
• License: gpl-3.0
• Created: 2021-12-14T05:51:38.000Z (about 3 years ago)
• Default Branch: master
• Last Pushed: 2022-03-19T23:57:13.000Z (almost 3 years ago)
• Last Synced: 2024-11-15T03:22:24.061Z (2 months ago)
• Topics: huffman-compression-algorithm, java, queues, tree-structure
• Language: Java
• Homepage: https://skully.tech
• Size: 24.4 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Funding: .github/FUNDING.yml
  • License: LICENSE

Awesome Lists containing this project

README

        
# Huffman Tree Text Compression

![License](https://img.shields.io/github/license/ImSkully/huffman-tree-encoding)

![Repo Size](https://img.shields.io/github/languages/code-size/ImSkully/huffman-tree-encoding)

![Version](https://img.shields.io/github/v/tag/ImSkully/huffman-tree-encoding)

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](https://github.com/ImSkully/huffman-tree-encoding/wiki).