Click here to Skip to main content
15,886,791 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
See more:
a project is given to me in which i have to select a text file and compress it using the modified huffman coding in which vitter and lzw algorthim should be used.....now i m very confused how these two algorthims will be used with huffman coding......kindly help me how should i modify the huffman algorithm.....
Posted
Comments
Richard MacCutchan 8-Jan-15 11:05am    
You need to study the algorithms to figure out how they can be used, and what, if any, changes you need to make.

1 solution

Maybe you want have a look here, here and here ;-).
As hint: Adaptive Huffman coding (also called Dynamic Huffman coding) uses the vitter algorithm.
If you compress a fille using lzw the output can be sqeezed even more using modified huffman on it... :-D
 
Share this answer
 
v2

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900