Rényi Entropies and Large Deviations for the First Match Function
From MaRDI portal
Publication:2978667
DOI10.1109/TIT.2015.2406695zbMath1359.94289OpenAlexW2096404661WikidataQ101496395 ScholiaQ101496395MaRDI QIDQ2978667
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2015.2406695
Dynamical systems and their relations with probability theory and stochastic processes (37A50) Measures of information, entropy (94A17)
Related Items (6)
R\'enyi entropy and pattern matching for run-length encoded sequences ⋮ Matching strings in encoded sequences ⋮ On the shortest distance between orbits and the longest common substring problem ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ From the divergence between two measures to the shortest path between two observables ⋮ Longest common substring for random subshifts of finite type
This page was built for publication: Rényi Entropies and Large Deviations for the First Match Function
