Title: Add Huffman Coding compression (1951)
Description: Extend the editor’s compression system by implementing Huffman Coding, introduced in 1951 by David A. Huffman. This algorithm improves upon RLE by using variable-length prefix codes based on symbol frequency.
Motivation: Huffman Coding is the natural next historical step after RLE and introduces entropy-based compression concepts.
Requirements:
Implement lossless Huffman compression and decompression
Build frequency table from input text
Generate prefix-free binary tree
Encode to bitstream (use byte packing)
Decode back to original text
Add year metadata: 1951
Add algorithm description to UI / README
Title: Add Huffman Coding compression (1951)
Description: Extend the editor’s compression system by implementing Huffman Coding, introduced in 1951 by David A. Huffman. This algorithm improves upon RLE by using variable-length prefix codes based on symbol frequency.
Motivation: Huffman Coding is the natural next historical step after RLE and introduces entropy-based compression concepts.
Requirements:
Implement lossless Huffman compression and decompression
Build frequency table from input text
Generate prefix-free binary tree
Encode to bitstream (use byte packing)
Decode back to original text
Add year metadata: 1951
Add algorithm description to UI / README