Skip to content
#

run-length-encoding

Here are 16 public repositories matching this topic...

I have worked on developing the implementation of Huffman Compression Algorithm on Strings along with run time encoding. Written in C, the program works on Min Heaps and Huffman Tree data structures. It uses Huffman algorithm—create a Huffman Tree using the frequencies of each character using heap data structure—and Run-time-encoding to compression

  • Updated Jan 28, 2023
  • C

It features a data compression system combining Huffman Coding and Run-Length Encoding (RLE) for efficient text compression. It uses a Min Heap-based Huffman Tree for optimal encoding and a Trie structure for fast decompression. The project includes performance analysis of time and space complexity, offering a memory-efficient solution.

  • Updated Feb 11, 2025
  • C

Improve this page

Add a description, image, and links to the run-length-encoding topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the run-length-encoding topic, visit your repo's landing page and select "manage topics."

Learn more