Finite-state coding of individual sequences
Paul C. Shields · 2002
It is shown that as window width goes to infinity the sliding-window form of the Lempel-Ziv algorithm compresses an individual sequence as well as block-to-variable finite-state coding. Examples are given showing that this can be better than the compression achievable by block-to-block finite-state codes with vanishing probability of error, and that a version of LZ with unbounded memory can do better.