Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
E Plotnik, MJ Weinberger, J Ziv - IEEE transactions on …, 1992 - ieeexplore.ieee.org
An upper bound on the probability of a sequence drawn from a finite-state source is derived.
The bound is given in terms of the number of phrases obtained by parsing the sequence
according to the Lempel-Ziv (LZ) incremental parsing rule, and is universal in the sense that
it does not depend on the statistical parameters that characterize the source. This bound is
used to derive an upper bound on the redundance of the LZ universal data compression
algorithm applied to finite-state sources, that depends on the length N of the sequence, on …
The bound is given in terms of the number of phrases obtained by parsing the sequence
according to the Lempel-Ziv (LZ) incremental parsing rule, and is universal in the sense that
it does not depend on the statistical parameters that characterize the source. This bound is
used to derive an upper bound on the redundance of the LZ universal data compression
algorithm applied to finite-state sources, that depends on the length N of the sequence, on …
Showing the best result for this search. See all results
