Finite memory universal predictability of binary sequences

Eado Meron^*, Meir Feder

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

Original language	English
Pages (from-to)	341
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228356
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003

Access to Document

@article{c05d23ef95db47bd81a24d850673ac80,

title = "Finite memory universal predictability of binary sequences",

author = "Eado Meron and Meir Feder",

year = "2003",

doi = "10.1109/isit.2003.1228356",

language = "אנגלית",

pages = "341",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Finite memory universal predictability of binary sequences

AU - Meron, Eado

AU - Feder, Meir

PY - 2003

Y1 - 2003

UR - http://www.scopus.com/inward/record.url?scp=0142008236&partnerID=8YFLogxK

U2 - 10.1109/isit.2003.1228356

DO - 10.1109/isit.2003.1228356

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0142008236

SN - 2157-8096

SP - 341

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -