Entropy and data compression schemes

DOI10.1109/18.179344zbMATH Open0764.94003OpenAlexW2152755776WikidataQ105584728 ScholiaQ105584728MaRDI QIDQ4034433FDOQ4034433

Benjamin Weiss, Donald S. Ornstein

Publication date: 16 May 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.179344

Recommendations

• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Redundancy estimates for the Lempel–Ziv algorithm of data compression
• Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
• The entropy theorem via coding bounds
• Compression and entropy

zbMATH Keywords

entropydata compressionShannon-McMillan-Breiman theoremLempel-Ziv parsingstationary ergodic process

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Cited In (83)

• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Generalized dimensions, large deviations and the distribution of rare events
• Dimension of sets of sequences defined in terms of recurrence of their prefixes
• Exponential law for random subshifts of finite type
• Entropy inequalities for semigroup actions
• Entry and return times distribution
• Convergence of recurrence of blocks for mixing processes
• Compression and entropy
• Statistics of Poincaré recurrences for a class of smooth circle maps
• Some remarks on filtering and prediction of stationary processes
• Recurrence speed of multiples of an irrational number.
• Title not available (Why is that?)
• A Central Limit Theorem for Non-Overlapping Return Times
• Return times, recurrence densities and entropy for actions of some discrete amenable groups
• THE CENTRAL LIMIT THEOREM FOR UNIFORMLY STRONG MIXING MEASURES
• Diophantine properties of iets and general systems: quantitative proximality and connectivity
• On the recurrence rates of continued fractions
• Entropy and prefixes
• Correlation decay and recurrence asymptotics for some robust nonuniformly hyperbolic maps
• Return time complexity of Sturmian sequences
• String matching bounds via coding
• The spectrum of Poincaré recurrence
• Quantitative recurrence in two-dimensional extended processes
• Diophantine approximation by orbits of expanding Markov maps
• Topological and almost Borel universality for systems with the weak specification property
• Optimal data compression algorithm
• Eulerian entropy and non-repetitive subword complexity
• On optimal parsing for LZ78-like compressors
• Coalescence and meeting times on \(n\)-block Markov chains
• Quantitative recurrence properties and homogeneous self-similar sets
• The multifractal spectra for the recurrence rates of beta-transformations
• More on recurrence and waiting times
• Epsilon Entropy and Data Compression
• ?-Entropy data compression
• Best approximation of orbits in iterated function systems
• The recurrence time for irrational rotations
• Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles
• Recurrence rates for observations of flows
• Generic continuous spectrum for ergodic Schrödinger operators
• Random subshifts of finite type
• Intermittent estimation of stationary time series
• BIAS REDUCTION OF THE NEAREST NEIGHBOR ENTROPY ESTIMATOR
• Zero-one law of Hausdorff dimensions of the recurrent sets
• Universal Data Compression Algorithm Based on Approximate String Matching
• Central limit theorem behavior in the skew tent map
• On universal algorithms for classifying and predicting stationary processes
• The multifractal spectra of certain planar recurrence sets in the continued fraction dynamical system
• Thin annuli property and exponential distribution of return times for weakly Markov systems
• Skew products, quantitative recurrence, shrinking targets and decay of correlations
• Relative entropy via non-sequential recursive pair substitution
• Quantitative Uniform Hitting in Exponentially Mixing Systems
• Internal Compression of Protocols to Entropy
• Sharp error terms for return time statistics under mixing conditions
• The waiting spectra of the sets described by the quantitative waiting time indicators
• Ergodic universality of some topological dynamical systems
• Local dimensions for Poincaré recurrences
• AN INTRODUCTION TO QUANTITATIVE POINCARÉ RECURRENCE IN DYNAMICAL SYSTEMS
• Quantitative Poincaré recurrence in continued fraction dynamical system
• Dimensions of recurrent sets in \(\beta\)-symbolic dynamics
• On processes which cannot be distinguished by finite observation
• Entry times distribution for dynamical balls on metric spaces
• The first return time properties of an irrational rotation
• Entropy structure
• Title not available (Why is that?)
• The first return time test of pseudorandom numbers
• Matching strings in encoded sequences
• The global statistics of return times: Return time dimensions versus generalized measure dimensions
• TOPOLOGICAL PRESSURE OF POINCARÉ RECURRENCE SET
• FLUCTUATIONS OF THE METRIC ENTROPY FOR MIXING MEASURES
• Entrance time and Rényi entropy
• Restricted sensitivity, return time and entropy in Feldman–Katok and mean metrics
• The almost sure invariance principle for beta-mixing measures
• The upper capacity topological entropy of free semigroup actions for certain non-compact sets
• Return-time -spectrum for equilibrium states with potentials of summable variation
• Some remarks on the notion of Bohr chaos and invariant measures
• Statistical mechanics of the data compression theorem
• Mismatched codebooks and the role of entropy coding in lossy data compression
• Title not available (Why is that?)
• Non-parametric change-point estimation using string matching algorithms
• Hausdorff dimensions of recurrent and shrinking target sets under Lipschitz functions for expanding Markov maps
• Recurrence times, waiting times and universal entropy production estimators
• ON THE STATISTICAL DISTRIBUTION OF FIRST-RETURN TIMES OF BALLS AND CYLINDERS IN CHAOTIC SYSTEMS
• Pressure and escape rates for random subshifts of finite type

This page was built for publication: Entropy and data compression schemes

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