Huffman coding is an entropy encoding algorithm used for lossless data compression. It has been implemented as full GUI form based using Priority Queues and Doubly Linked List with Binary Trees. Compression Ratio is average around 27%.
-
Notifications
You must be signed in to change notification settings - Fork 1
Huffman coding is an entropy encoding algorithm used for lossless data compression. It has been implemented as full GUI form based using Priority Queues and Doubly Linked List with Binary Trees. Compression Ratio is average around 27%.
License
ManuKothari/Huffman-Coding---Java--
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Huffman coding is an entropy encoding algorithm used for lossless data compression. It has been implemented as full GUI form based using Priority Queues and Doubly Linked List with Binary Trees. Compression Ratio is average around 27%.
Resources
License
Stars
Watchers
Forks
Releases
No releases published