Title :
Finite memory universal predictability of binary sequences
Author :
Meron, Eado ; Feder, Meir
Author_Institution :
Tel Aviv University
fDate :
29 June-4 July 2003
Keywords :
Binary sequences; Convergence; Counting circuits; Hamming distance; Performance analysis; Random access memory; USA Councils; Upper bound;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228356
