Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the largest code.
-
Notifications
You must be signed in to change notification settings - Fork 0
twinklesharma1311/Huffman-Coding
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented Huffman coding algorithm in C as part of under-graduation project. It is a lossless data compression algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published