Compressão/descompressão de dados: uma variação do algoritmo LZW.

Abstract

A one-step compression algorithm that exploits reference locality is described, such as occurs when patterns are often used in a particular portion of messages or files and then fall into disuse. The algorithm is a modification of the LZW algorithm presented by Welch. Measurements obtained with royal archives indicate better performance against LZW and Huffman techniques.