A universal finite memory source
From MaRDI portal
Publication:4836891
DOI10.1109/18.382011zbMath0820.94002OpenAlexW2095963120WikidataQ105584726 ScholiaQ105584726MaRDI QIDQ4836891
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
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical aspects of information-theoretic topics (62B10) Communication theory (94A05) Source coding (94A29)
Related Items
The mixture transition distribution model for high-order Markov chains and non-Gaussian time series, Entropy estimation of symbol sequences, Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains, Lossless compression of map contours by context tree modeling of chain codes, Sparse Markov Chains for Sequence Data, Stochastic complexity in learning, A framework for space-efficient string kernels, Stratified graphical models -- context-specific independence in graphical models, Variable length Markov chains, Relevant states and memory in Markov chain bootstrapping and simulation, Bayesian analysis of variable-order, reversible Markov chains, Universal coding algorithm for a family of context Markov sources, Consistent estimation of the basic neighborhood of Markov random fields, Second step algorithms in the Burrows-Wheeler compression algorithm, Context-Specific and Local Independence in Markovian Dependence Structures, Estimation of General Stationary Processes by Variable Length Markov Chains, Distributions of pattern statistics in sparse Markov models, Efficient and adaptive post-model-selection estimators, The consistency of the BIC Markov order estimator., Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDG models
