Title :
Finite-state coding of individual sequences
Author :
Shields, Paul C.
Author_Institution :
Dept. of Math., Toledo Univ., OH, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
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
Keywords :
data compression; encoding; probability; sequences; Lempel-Ziv algorithm; block-to-block finite-state code; block-to-variable finite-state coding; compression; error probability; individual sequences; sliding-window form; unbounded memory; window width; Artificial intelligence; Entropy; H infinity control; Mathematics;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613354
