Non-sequential recursive pair substitution: some rigorous results

DOI10.1088/1742-5468/2006/09/P09011zbMath1456.94036arXivcond-mat/0607749MaRDI QIDQ5239313

Dario Benedetto, Davide Gabrielli, Emanuele Caglioti

Publication date: 22 October 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0607749

zbMATH Keywords

source and channel coding

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (1)

Relative entropy via non-sequential recursive pair substitution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the syntactic structure of protein sequences and the concept of grammar complexity
• On grammars, complexity, and information measures of biological macromolecules
• Data compression and learning in time sequences analysis
• Analysis of symbolic sequences using the Jensen-Shannon divergence
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Entropy estimation of symbol sequences
• Artificial sequences and complexity measures
• Information and dynamical systems: A concrete measurement on sporadic dynamics

This page was built for publication: Non-sequential recursive pair substitution: some rigorous results