Skip to content
#

huffman-algorithm

Here are 73 public repositories matching this topic...

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 they used to and the least frequent symbols will take more space.

  • Updated Aug 14, 2021
  • C++

This is the implementation of 3rd Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 3.

  • Updated Apr 7, 2021
  • Jupyter Notebook

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