Fast lossless data compression in Java

Encode Decode Step by Step is an open-source educational application designed to simplify bitwise file encodings. It integrates six encoding algorithms: Delta, Unary, Elias-Gamma, Fibonacci, Golomb, and Huffman - through a user-friendly graphical interface. Ideal for educational use, this tool offers a hands-on approach to teach encoding strategies

Huffman input and output streams

Personal repo of SUSTech course CS208 Algorithm Design

Compactador e descompactador de dados.

Computer Science/Algorithms & Data Structures etc. labs

Java implementation of the Huffman, LZ77, and LZW compression algorithms.

Using Huffman algorithm to compress file on the server and send it to the client

implementation of common Data Structures in java

Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. It's usually implemented via a greedy approach.

Implementation of Huffman tree in Java.

A new set of lossy and lossless graph compression techniques for external memory representation.

Some important algorithms implementation

Huffman Encryption Scheme using Order Statistics Tree for Energy Efficient Data Transmission

Huffman Algorithm based encoding and decoding tool

Text encryption and decryption using Huffman Code with java

Text Compression is a program that compresses the physical size of text file (txt pdf etc) using Huffman, BWT and MTF. These three algorithms are combined in different sequences to check which combination does the most compression.

Implementation of the Huffman codification with java, using a minHeap and a binary tree, for the Data Structures course (URV, 2021)

Just a simple course design.