Context tree weighting : a sequential universal source coding procedure for FSMX sources

F.M.J. Willems, Y.M. Shtarkov, T.J. Tjalkens

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

16 Citations (Scopus)

Abstract

A binary FSMX source generates a given sequence of digits from {0, l} whose statistical behavior can be described using a postfix set S. This postfix set is a collection of binary strings which is proper and complete. To weigh an infinite number of models, the authors introduce a principle which says that the model-redundancy has to be proportional to the number of free parameters of the model. It gives us a weighting distribution over all models. A efficient method is outlines that weighs the block probabilities of all models according to this distribution.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages59
Number of pages1
ISBN (Print)0-7803-0878-6
DOIs
Publication statusPublished - 1 Jan 1993
Event1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Conference

Conference1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint Dive into the research topics of 'Context tree weighting : a sequential universal source coding procedure for FSMX sources'. Together they form a unique fingerprint.

Cite this