A recurrence theorem for dependent processes with applications to data compression
From MaRDI portal
Publication:4014179
DOI10.1109/18.149506zbMath0775.94079OpenAlexW2012771743WikidataQ105584724 ScholiaQ105584724MaRDI QIDQ4014179
Andrew B. Nobel, Aaron D. Wyner
Publication date: 12 October 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d0acbe7943f2d5e2f2c65fac1c607bc48e088e2e
Related Items (9)
Coalescence and meeting times on \(n\)-block Markov chains ⋮ 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? ⋮ Entry and return times distribution ⋮ Waiting times: Positive and negative results on the Wyner-Ziv problem ⋮ From the divergence between two measures to the shortest path between two observables ⋮ The almost sure invariance principle for beta-mixing measures ⋮ THE CENTRAL LIMIT THEOREM FOR UNIFORMLY STRONG MIXING MEASURES
This page was built for publication: A recurrence theorem for dependent processes with applications to data compression
