Adaptive limitation of the dictionary size in LZW data compression

摘要

Two modifications of the Lempel-Ziv-Welch (LZW) algorithm arepresented to limit the dictionary size. First, a run-length encoding(RLE) is combined with the LZW algorithm, in order to preselect theinput data. Then, a dynamic update of the dictionary is performed byeliminating the free branches in the tree representing the dictionary