Skip to content

This is the implementation of Huffman Coding, which is a lossless data compression technique. In this project we have tried to create the Huffman tree and assign codewords to characters.

Notifications You must be signed in to change notification settings

jayneel-shah18/Huffman-Coding-Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Huffman-Coding-Tree

  • This is the implementation of Huffman Coding, which is a lossless data compression technique.
  • In this project we have tried to create the Huffman tree and assign codewords to characters.
  • The project was a part of our Digital Communications course.

Original contributors

Name Github username
Het Patel @het4902
Jainik Bakshi @jainikbakshi
Jayneel Shah @jayneel-shah18

About

This is the implementation of Huffman Coding, which is a lossless data compression technique. In this project we have tried to create the Huffman tree and assign codewords to characters.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages