Prediction of binary sequences using finite memory

M. Feder, E. Federovski

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

Abstract

We provide a non-asymptotic analysis of two common finite memory predictors for binary sequences: a predictor with a saturated counter and a predictor that uses only a finite window of past samples. The saturated counter predictor is superior.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages137
Number of pages1
DOIs
StatePublished - 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Prediction of binary sequences using finite memory'. Together they form a unique fingerprint.

Cite this