本项目是基于 Java 实现的哈夫曼编码文本压缩解压工具，按照字符频率构建哈夫曼树、生成哈夫曼编码映射、压缩解压文件。 This project is a Huffman coding-based text compression and decompression tool implemented in Java. It constructs a Huffman tree according to character frequencies, generates Huffman coding mappings, and enables file compression and decompression.

A Java program that implements (4) four lossless text compression techniques for ASCII Text and compares compression ratio.

I along my project partner was given "Text Compression" as a final lab task. We were asked to combine 3 algorithms, huffman, BWT, MTF, in different orders to check which order does the most compression.

TextCompressor with compression and decompression algorithms: LZW RLE Huffman Coding algorithm

A simple Java implementation of the LZW (Lempel-Ziv-Welch) algorithm for compressing and decompressing text files. Supports both compression and restoration of original content.

Text File Huffman Compression

[EN] Implementation of the Huffman compression algorithm in Java | [FR] Implémentation de l'algorithme de compression de Huffman en Java

A simple, lossless text file compressor and decompressor built in Java using Huffman Coding. It shrinks files by giving shorter codes to frequent characters, and restores them exactly when decompressed. Features include a command‑line interface, clean modular design, and efficient bit‑level file handling

Huffman Coding implementation using Java backend and web interface for lossless text compression. Ideal for DSA, algorithms, and academic projects.