Problems of robustness for universal coding schemes

DOI10.1023/A:1023626414365MaRDI QIDQ2487076zbMATH OpenOpenAlexFDO

Publication date 17 August 2005

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.4572

coding and information theory compression source coding

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Abstract: The Lempel-Ziv universal coding scheme is asymptotically optimal for the class of all stationary ergodic sources. A problem of robustness of this property under small violations of ergodicity is studied. A notion of deficiency of algorithmic randomness is used as a measure of disagreement between data sequence and probability measure. We prove that universal compressing schemes from a large class are non-robust in the following sense: if the randomness deficiency grows arbitrarily slowly on initial fragments of an infinite sequence then the property of asymptotic optimality of any universal compressing algorithm can be violated. Lempel-Ziv compressing algorithms are robust on infinite sequences generated by ergodic Markov chains when the randomness deficiency of its initial fragments of length

n

grows as

o (n)

.

Review text

Well-known compression schemes (such as Lempel-Ziv algorithms), that are universal for classes of stationary ergodic sources, are considered in the paper. An important property of these universal coding schemes is that they are asymptotically optimal for the class of all stationary ergodic sources. A problem of robustness of this property under small violations of ergodicity is studied. Algorithms working with constructive objects (that is, integer and rational numbers, or words in a finite alphabet) are under consideration. A theorem is given that asserts that optimal compression scheme, corresponding to the Kolmogorov complexity is non robust in the class of all stationary ergodic sources. As a consequence of this theorem, a result on non robustness of computable universal coding schemes is given. The notion of deficiency of algorithmic randomness is used as a measure of disagreement between data sequence and probability measure. It is proven that universal compression schemes form a large class which is nonrobust in the following sense: If the randomness deficiency grows arbitrarily slowly on initial fragments of an infinitive sequence, then the property of asymptotic optimality of any universal compression algorithm can be violated. Particularly Lempel-Ziv compression algorithms are robust on infinitive sequences generated by ergodic Markov chains when the randomness deficiency of their initial fragments of length \(n\) grows as \(o(n)\).

Recommendations

Cited in

(11)

This page was built for publication: Problems of robustness for universal coding schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487076)