Abstract
The LZW is an effective and adaptive data compression algorithm, but during the encoding process, the entries in the dictionary would store characters that have been stored leading to waste memory resources, so this paper presents a improved algorithm for LZW compression algorithm. On the one hand, the content of the source file is transformed into 01 character string; on the other hand, adopting binary tree structure to store the entries of the dictionary. There are some simulation experiments for different sizes files, the results show that the improved LZW algorithm overcomes effectively the shortcoming in dictionary storage structure of the original algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
