The Shortest Possible Return Time of <inline-formula> <tex-math notation="LaTeX">\beta </tex-math> </inline-formula>-Mixing Processes

DOI10.1109/TIT.2017.2757494zbMATH Open1401.60054DBLPjournals/tit/AbadiGR18OpenAlexW2757244282WikidataQ101496399 ScholiaQ101496399MaRDI QIDQ4682811FDOQ4682811

Authors: Miguel Abadi, Sandro Gallo, Erika Alejandra Rada-Mora 

Publication date: 19 September 2018

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

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Stationary stochastic processes (60G10)

Cited In (3)

• Rényi entropy and pattern matching for run-length encoded sequences
• Clustering indices and decay of correlations in non-Markovian models
• Matching strings in encoded sequences

This page was built for publication: The Shortest Possible Return Time of <inline-formula> <tex-math notation="LaTeX">$\beta$ </tex-math> </inline-formula>-Mixing Processes

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