LZX algorithm

from Wikipedia, the free encyclopedia

The LZX algorithm is a lossless data compression method based on the Lempel-Ziv algorithm from 1977 and developed by Jonathan Forbes and Tomi Poutanen .

As an extension to the Lempel-Ziv algorithm, the position information is encoded more efficiently, including a. with a three-element LRU list .

commitment

The procedure was first implemented in 1995 in the compression program of the same name as shareware for the Commodore Amiga .

The LZX algorithm has also been available in Microsoft's CAB format since 1997 . In contrast to the original implementation, search windows of variable sizes are also supported.

Web links