- it was an assigment
- it is just an alogrithm called adaptive huffman algorithm , it helps to solve the problem of older huffmans (a statstical informations is needed to work) it behaves based on the current data -it uses the concept of the non linear data structre trees -at the begining each entry in the data has a fixed code then it change during the process
-
Notifications
You must be signed in to change notification settings - Fork 0
Abdelrhman199/Adaptive-Huffman-compression-
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
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published