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

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

doi:10.1109/ISIT.1993.748374

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 proceeding › Conference contribution › Academic › peer-review

20 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 language	English
Title of host publication	Proceedings of the 1993 IEEE International Symposium on Information Theory
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	59
Number of pages	1
ISBN (Print)	0-7803-0878-6
DOIs	https://doi.org/10.1109/ISIT.1993.748374
Publication status	Published - 1 Jan 1993
Event	1993 IEEE International Symposium on Information Theory, ISIT 1993 - San Antonio, United States Duration: 17 Jan 1993 → 22 Jan 1993

Conference

Conference	1993 IEEE International Symposium on Information Theory, ISIT 1993
Abbreviated title	ISIT
Country/Territory	United States
City	San Antonio
Period	17/01/93 → 22/01/93

Access to Document

10.1109/ISIT.1993.748374

Cite this

@inproceedings{f017154bb5844e6a8058b6e42f1089d7,

title = "Context tree weighting : a sequential universal source coding procedure for FSMX sources",

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.",

author = "F.M.J. Willems and Y.M. Shtarkov and T.J. Tjalkens",

year = "1993",

month = jan,

day = "1",

doi = "10.1109/ISIT.1993.748374",

language = "English",

isbn = "0-7803-0878-6 ",

pages = "59",

booktitle = "Proceedings of the 1993 IEEE International Symposium on Information Theory",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "1993 IEEE International Symposium on Information Theory, ISIT 1993, ISIT ; Conference date: 17-01-1993 Through 22-01-1993",

}

Willems, FMJ, Shtarkov, YM & Tjalkens, TJ 1993, Context tree weighting : a sequential universal source coding procedure for FSMX sources. in Proceedings of the 1993 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers, Piscataway, pp. 59, 1993 IEEE International Symposium on Information Theory, ISIT 1993, San Antonio, Texas, United States, 17/01/93. https://doi.org/10.1109/ISIT.1993.748374

Context tree weighting : a sequential universal source coding procedure for FSMX sources. / Willems, F.M.J.; Shtarkov, Y.M.; Tjalkens, T.J.
Proceedings of the 1993 IEEE International Symposium on Information Theory. Piscataway: Institute of Electrical and Electronics Engineers, 1993. p. 59.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Willems, F.M.J.

AU - Shtarkov, Y.M.

AU - Tjalkens, T.J.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

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

U2 - 10.1109/ISIT.1993.748374

DO - 10.1109/ISIT.1993.748374

M3 - Conference contribution

AN - SCOPUS:0027166495

SN - 0-7803-0878-6

SP - 59

BT - Proceedings of the 1993 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 1993 IEEE International Symposium on Information Theory, ISIT 1993

Y2 - 17 January 1993 through 22 January 1993

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this