Waiting times: Positive and negative results on the Wyner-Ziv problem

DOI10.1007/BF01066715zbMath0776.60082WikidataQ105583381 ScholiaQ105583381MaRDI QIDQ685735

Paul C. Shields

Publication date: 3 October 1993

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

zbMATH Keywords

Markov chainsalmost sure convergenceasymptotic properties of the waiting timestationary codingweak Bernoulli processes

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Coalescence and meeting times on \(n\)-block Markov chains ⋮ Entrance time and Rényi entropy ⋮ 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? ⋮ The multifractal spectra of certain planar recurrence sets in the continued fraction dynamical system ⋮ Decay of correlations for maps with uniformly contracting fibers and logarithm law for singular hyperbolic attractors ⋮ The waiting spectra of the sets described by the quantitative waiting time indicators ⋮ The dynamical Borel-Cantelli Lemma and the waiting time problems ⋮ Entry and return times distribution ⋮ Lorenz-like flows: exponential decay of correlations for the Poincaré map, logarithm law, quantitative recurrence ⋮ From the divergence between two measures to the shortest path between two observables ⋮ More on recurrence and waiting times ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

Cites Work

• Unnamed Item
• Unnamed Item
• How sampling reveals a process
• Entropy and prefixes
• String matching: The ergodic case
• The limits in \(d\) of multi-step Markov chains
• Entropy and the consistent estimation of joint distributions
• On isomorphism of weak Bernoulli transformations
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• A recurrence theorem for dependent processes with applications to data compression
• Sliding-block source coding
• Block and sliding-block source coding
• Stationary coding of processes