Universal finite memory machines for coding binary sequences

Doron Rajwan*, Meir Feder

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

In this work we consider the problem of universal sequential probability assignment, under the self-information loss, where the machine for performing the universal probability assignment is constrained to have a finite memory. Sequential probability assignment is equivalent to lossless source coding if we ignore the number of states required to convert the probability estimate into code bits. We consider both the probabilistic setting where the sequence is generated by a probabilistic source (either Bernoulli i.i.d. source or q-th order Markov source), and the deterministic setting where the sequence is a deterministic individual sequence. We also consider the case where the universal machine is deterministic, randomized, time-invariant or time-variant. We provide in most cases lower bounds and describe finite memory universal machines whose performance, in terms of the memory size, is compared to these bounds.

Original languageEnglish
Pages (from-to)113-122
Number of pages10
JournalProceedings of the Data Compression Conference
StatePublished - 2000
EventData Compression Conference - DDC 2000 - Snowbird, UT, USA
Duration: 28 Mar 200030 Mar 2000

Fingerprint

Dive into the research topics of 'Universal finite memory machines for coding binary sequences'. Together they form a unique fingerprint.

Cite this