Title :
Prediction of binary sequences using finite memory
Author :
Feder, Meir ; Federovski, Eitan
Author_Institution :
Tel Aviv Univ., Israel
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
Keywords :
binary sequences; prediction theory; probability; binary sequences; finite memory predictors; finite window of past samples; non-asymptotic analysis; prediction; probabilistic source; saturated counter; Binary sequences; Counting circuits; Statistics; Transient analysis;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708729
