Relative entropy via non-sequential recursive pair substitution
From MaRDI portal
Publication:3301194
DOI10.1088/1742-5468/2010/09/P09010zbMath1456.94031arXiv1007.3384OpenAlexW3104791036MaRDI QIDQ3301194
No author found.
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3384
Cites Work
- Unnamed Item
- Asymptotic recurrence and waiting times for stationary processes
- Data compression and learning in time sequences analysis
- Universal Entropy Estimation Via Block Sorting
- The Similarity Metric
- Universal Divergence Estimation for Finite-Alphabet Sources
- An example of mathematical authorship attribution
- Entropy and data compression schemes
- A universal algorithm for sequential data compression
- A measure of relative entropy between individual sequences with application to universal classification
- Non-sequential recursive pair substitution: some rigorous results
This page was built for publication: Relative entropy via non-sequential recursive pair substitution