Complexity of strings in the class of Markov sources

DOI10.1109/TIT.1986.1057210zbMath0621.94005OpenAlexW2148381206MaRDI QIDQ3758710

Jorma Rissanen

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1109/tit.1986.1057210

zbMATH Keywords

entropycomplexityMarkov sourcesfinite-state-machine defined sourcesminimum mean code-lengthShannon's self information

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items

Predictive stochastic complexity and model estimation for finite-state processes ⋮ Variable length Markov chains ⋮ The power of amnesia: Learning probabilistic automata with variable memory length ⋮ Relevant states and memory in Markov chain bootstrapping and simulation ⋮ Exponential bounds for the probability of wrong determination of the order of a Markov chain by using the EDC criterion ⋮ Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ Distributions of pattern statistics in sparse Markov models ⋮ Some results on tries with adaptive branching.