PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 24, 200534 citations

Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources

View Full Paper
FWF.M.J. WillemsYSYuM ShtarkovTTT.J. Tjalkens

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Willems et al. (2005) studied this question.

synapsesocial.com/papers/6a11c2f3276e1b6925c909b3https://doi.org/10.1109/isit.1993.748374
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A sequential algorithm for the universal coding of finite memory sources1992 · 85 citations
  2. 2Complexity of strings in the class of Markov sources1986 · 194 citations
  3. 3Universal modeling and coding1981 · 462 citations
  4. 4The performance of universal encoding1981 · 547 citations
  5. 5A universal data compression system1983 · 642 citations