A recurrence theorem for dependent processes with applications to data compression

DOI10.1109/18.149506MaRDI QIDQ4014179zbMATH OpenOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(9)

• The almost sure invariance principle for beta-mixing measures
• Coalescence and meeting times on \(n\)-block Markov chains
• The central limit theorem for uniformly strong mixing measures
• Convergence of recurrence of blocks for mixing processes
• Almost-sure waiting time results for weak and very weak Bernoulli processes
• From the divergence between two measures to the shortest path between two observables
• Entry and return times distribution
• On a waiting-time result of Kontoyiannis: mixing or decoupling?
• Waiting times: Positive and negative results on the Wyner-Ziv problem

This page was built for publication: A recurrence theorem for dependent processes with applications to data compression

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