A sequential algorithm for the universal coding of finite memory sources

DOI10.1109/18.135641zbMath0749.94007OpenAlexW2116190532MaRDI QIDQ4008332

Jacob Ziv, Abraham Lempel, Marcelo J. Weinberger

Publication date: 27 September 1992

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

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

zbMATH Keywords

state estimationdata compressiondiscrete sourcesuniversal coding of finite memory sources

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (6)

Predictive stochastic complexity and model estimation for finite-state processes ⋮ Lempel-Ziv complexity analysis of one dimensional cellular automata ⋮ 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 ⋮ Distributions of pattern statistics in sparse Markov models

This page was built for publication: A sequential algorithm for the universal coding of finite memory sources