Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm.
Eli PlotnikMarcelo J. WeinbergerJacob ZivPublished in: IEEE Trans. Inf. Theory (1992)
Keyphrases
- finite state
- lempel ziv
- upper bound
- computational complexity
- learning algorithm
- dynamic programming
- lower and upper bounds
- model checking
- optimal solution
- string matching
- compression scheme
- distance function
- markov chain
- lower bound
- graph matching
- data compression
- markov decision processes
- variable length
- search space
- single pass