R\'enyi entropy and pattern matching for run-length encoded sequences
From MaRDI portal
Publication:4989421
zbMath1469.60094arXiv2003.05500MaRDI QIDQ4989421
Publication date: 25 May 2021
Full work available at URL: https://arxiv.org/abs/2003.05500
Stationary stochastic processes (60G10) Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Ergodicity, mixing, rates of mixing (37A25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching with shift for one-dimensional Gibbs measures
- Potential well spectrum and hitting time in renewal processes
- Hardness of comparing two run-length encoded strings
- Mixing properties of ARMA processes
- Matching for run-length encoded strings
- Mixing: Properties and examples
- On the shortest distance between orbits and the longest common substring problem
- Shortest distance between multiple orbits and generalized fractal dimensions
- Matching strings in encoded sequences
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- Rényi Entropies and Large Deviations for the First Match Function
- Ruelle's Operator Theorem and g-Measures
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- A suboptimal lossy data compression based on approximate pattern matching
- Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
- Maximal Repetition and Zero Entropy Rate
- On Computing Average Common Substring Over Run Length Encoded Sequences
- The Shortest Possible Return Time of <inline-formula> <tex-math notation="LaTeX">$\beta$ </tex-math> </inline-formula>-Mixing Processes
- A Phase Transition for the Distribution of Matching Blocks
- The Rényi entropy function and the large deviation of short return times
- Computation and Estimation of Generalized Entropy Rates for Denumerable Markov Chains
- On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
This page was built for publication: R\'enyi entropy and pattern matching for run-length encoded sequences