Adaptive limitation of the dictionary size in LZW data compression
Karim Ouaissa, Mourad Abdat, P. Plume · 2002
Two modifications of the Lempel-Ziv-Welch (LZW) algorithm are presented to limit the dictionary size. First, a run-length encoding (RLE) is combined with the LZW algorithm, in order to preselect the input data. Then, a dynamic update of the dictionary is performed by eliminating the free branches in the tree representing the dictionary.