The Shortest Possible Return Time of <inline-formula> <tex-math notation="LaTeX">$\beta$ </tex-math> </inline-formula>-Mixing Processes
From MaRDI portal
Publication:4682811
DOI10.1109/TIT.2017.2757494zbMath1401.60054DBLPjournals/tit/AbadiGR18OpenAlexW2757244282WikidataQ101496399 ScholiaQ101496399MaRDI QIDQ4682811
Erika Alejandra Rada-Mora, Sandro Gallo, Miguel Abadi
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
Related Items (3)
R\'enyi entropy and pattern matching for run-length encoded sequences ⋮ Matching strings in encoded sequences ⋮ Clustering indices and decay of correlations in non-Markovian models
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