Universal filtering and prediction of individual sequences corrupted by noise using the Lempel-Ziv algorithm

We address the problem of filtering and prediction of an individual binary sequence based on its noisy past, as an extension to the work of Baruch and Merhav (see Proc. ISIT, p. 331, 1998). The performance criterion investigated is the expected fraction of errors. We propose algorithms and compare their performance to that, of the best finite state machine (FSM). We improve on previous results of Baruch et al. by showing that optimum performance can be achieved by Lempel-Ziv-based estimation algorithms