Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
From MaRDI portal
Publication:3472037
DOI10.1109/18.45281zbMath0695.94003OpenAlexW2103756638WikidataQ105584736 ScholiaQ105584736MaRDI QIDQ3472037
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.45281
entropydata-compression coding schemesLempel-Ziv data compression algorithmstationary ergodic information source
Related Items
Stochastic sub-additivity approach to the conditional large deviation principle ⋮ Coalescence and meeting times on \(n\)-block Markov chains ⋮ Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane ⋮ The recurrence time for irrational rotations ⋮ Matching strings in encoded sequences ⋮ Analytical depoissonization and its applications ⋮ Almost-sure waiting time results for weak and very weak Bernoulli processes ⋮ Convergence of recurrence of blocks for mixing processes ⋮ On a waiting-time result of Kontoyiannis: mixing or decoupling? ⋮ Quasi-distinct parsing and optimal compression methods ⋮ Recurrence times, waiting times and universal entropy production estimators ⋮ The first return time properties of an irrational rotation ⋮ The waiting spectra of the sets described by the quantitative waiting time indicators ⋮ Waiting times: Positive and negative results on the Wyner-Ziv problem ⋮ Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter ⋮ Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics ⋮ Uncommon suffix tries ⋮ Convergence properties of functional estimates for discrete distributions ⋮ On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol ⋮ Optimal encoding of non-stationary sources ⋮ Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles ⋮ Sharp error terms for return time statistics under mixing conditions ⋮ From the divergence between two measures to the shortest path between two observables ⋮ Quasi-distinct Parsing and Optimal Compression Methods ⋮ Optimal data compression algorithm ⋮ Estimating entropy rate from censored symbolic time series: A test for time-irreversibility ⋮ Universal Data Compression Algorithm Based on Approximate String Matching ⋮ A Central Limit Theorem for Non-Overlapping Return Times ⋮ Return times, recurrence densities and entropy for actions of some discrete amenable groups ⋮ More on recurrence and waiting times ⋮ The asymptotics of waiting times between stationary processes, allowing distortion ⋮ The almost sure invariance principle for beta-mixing measures ⋮ The first return time test of pseudorandom numbers