Skip to content
#

huffman-algorithm

Here are 128 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

The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input, we want to encode the most frequent symbols will take less space than …

  • Updated Aug 14, 2021
  • C++

Created by David Huffman a Huffman Coding Algorithm where data is being compressed using the Huffman Coding technique to become smaller without losing any of its information.

  • Updated Jun 12, 2024
  • Python

Improve this page

Add a description, image, and links to the huffman-algorithm 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 huffman-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more