Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
From MaRDI portal
Publication:3472037
Recommendations
Cited in
(50)- Problems of robustness for universal coding schemes
- Compressibility analysis of asymptotically mean stationary processes
- Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles
- Convergence properties of functional estimates for discrete distributions
- scientific article; zbMATH DE number 3893089 (Why is no real title available?)
- Entropy and data compression schemes
- Return times, recurrence densities and entropy for actions of some discrete amenable groups
- Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources
- The almost sure invariance principle for beta-mixing measures
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
- Estimating entropy rate from censored symbolic time series: A test for time-irreversibility
- The asymptotics of waiting times between stationary processes, allowing distortion
- The first return time test of pseudorandom numbers
- Almost-sure waiting time results for weak and very weak Bernoulli processes
- Recurrence times, waiting times and universal entropy production estimators
- scientific article; zbMATH DE number 4162803 (Why is no real title available?)
- From the divergence between two measures to the shortest path between two observables
- Entropy and distinct parsing for ergodic sources
- Analytical depoissonization and its applications
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Universally typical sets for ergodic sources of multidimensional data
- On a waiting-time result of Kontoyiannis: mixing or decoupling?
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
- Convergence of recurrence of blocks for mixing processes
- Sharp error terms for return time statistics under mixing conditions
- Selected data compression: a refinement of Shannon's principle
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- Quasi-distinct parsing and optimal compression methods
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- Compression and entropy
- Building sources of zero entropy: rescaling and inserting delays (invited talk)
- The recurrence time for irrational rotations
- Optimal data compression algorithm
- Uncommon suffix tries
- Waiting times: Positive and negative results on the Wyner-Ziv problem
- On typical encodings of multivariate ergodic sources.
- A note on Kolmogorov complexity and entropy
- Stochastic sub-additivity approach to the conditional large deviation principle
- Quasi-distinct Parsing and Optimal Compression Methods
- Optimal encoding of non-stationary sources
- A catalog of self-affine hierarchical entropy functions
- More on recurrence and waiting times
- Universal Data Compression Algorithm Based on Approximate String Matching
- The waiting spectra of the sets described by the quantitative waiting time indicators
- An informational approach to the problem of compressing random processes
- scientific article; zbMATH DE number 3983063 (Why is no real title available?)
- Matching strings in encoded sequences
- Coalescence and meeting times on \(n\)-block Markov chains
- The first return time properties of an irrational rotation
- A Central Limit Theorem for Non-Overlapping Return Times
This page was built for publication: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472037)
