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

Jacob Ziv, Aaron D. Wyner

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




Related Items

Stochastic sub-additivity approach to the conditional large deviation principleCoalescence and meeting times on \(n\)-block Markov chainsContrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy planeThe recurrence time for irrational rotationsMatching strings in encoded sequencesAnalytical depoissonization and its applicationsAlmost-sure waiting time results for weak and very weak Bernoulli processesConvergence of recurrence of blocks for mixing processesOn a waiting-time result of Kontoyiannis: mixing or decoupling?Quasi-distinct parsing and optimal compression methodsRecurrence times, waiting times and universal entropy production estimatorsThe first return time properties of an irrational rotationThe waiting spectra of the sets described by the quantitative waiting time indicatorsWaiting times: Positive and negative results on the Wyner-Ziv problemProbabilistic modeling of data structures on words. A reply to Professor Andersson's letterShannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physicsUncommon suffix triesConvergence properties of functional estimates for discrete distributionsOn the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocolOptimal encoding of non-stationary sourcesEstimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindlesSharp error terms for return time statistics under mixing conditionsFrom the divergence between two measures to the shortest path between two observablesQuasi-distinct Parsing and Optimal Compression MethodsOptimal data compression algorithmEstimating entropy rate from censored symbolic time series: A test for time-irreversibilityUniversal Data Compression Algorithm Based on Approximate String MatchingA Central Limit Theorem for Non-Overlapping Return TimesReturn times, recurrence densities and entropy for actions of some discrete amenable groupsMore on recurrence and waiting timesThe asymptotics of waiting times between stationary processes, allowing distortionThe almost sure invariance principle for beta-mixing measuresThe first return time test of pseudorandom numbers