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

A. Somekh Baruch, N. Merhav

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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
Original languageAmerican English
Title of host publicationInformation Theory, 2000. Proceedings. IEEE International Symposium on
PublisherIEEE
StatePublished - 2000

Bibliographical note

Place of conference:Italy

Fingerprint

Dive into the research topics of 'Universal filtering and prediction of individual sequences corrupted by noise using the Lempel-Ziv algorithm'. Together they form a unique fingerprint.

Cite this