A universal finite memory source

DOI10.1109/18.382011MaRDI QIDQ4836891zbMATH OpenOpenAlexWikidataFDO

Authors Marcelo J. Weinberger, Jorma Rissanen, Meir Feder

Publication date 11 September 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/aa08e183f984577952abd30178867e25ce19d7b5

zbMATH Keywords

finite memory sourcespredictiontree machineuniversal codinguniversal source

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05) Source coding (94A29)

Recommendations

• A sequential algorithm for the universal coding of finite memory sources
• The context-tree weighting method: basic properties
• Universal coding algorithm for a family of context Markov sources
• A universal algorithm for sequential data compression
• Multi-alphabet universal coding of memoryless sources

Cited in

(24)

• Efficient and adaptive post-model-selection estimators
• Stochastic complexity in learning
• Relevant states and memory in Markov chain bootstrapping and simulation
• The consistency of the BIC Markov order estimator.
• The mixture transition distribution model for high-order Markov chains and non-Gaussian time series
• Variable length Markov chains
• Universal coding algorithm for a family of context Markov sources
• Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains
• Consistent estimation of the basic neighborhood of Markov random fields
• Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDG models
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Sparse Markov chains for sequence data
• An existence theorem in information theory
• Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
• Universal Delay-Limited Simulation
• Estimation of General Stationary Processes by Variable Length Markov Chains
• Entropy estimation of symbol sequences
• scientific article; zbMATH DE number 777288 (Why is no real title available?)
• Context-specific and local independence in Markovian dependence structures
• Bayesian analysis of variable-order, reversible Markov chains
• Computation of exact probabilities associated with overlapping pattern occurrences
• Distributions of pattern statistics in sparse Markov models
• Lossless compression of map contours by context tree modeling of chain codes
• Stratified graphical models -- context-specific independence in graphical models

This page was built for publication: A universal finite memory source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836891)