Compression and entropy

DOI10.1007/3-540-55210-3_209zbMath1494.68080OpenAlexW1551117435MaRDI QIDQ5096807

Georges Hansel, Dominique Perrin, Imre Simon

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_209

zbMATH Keywords

topological entropyinvariant probability measureHuffman codeinfinite subsetcompression rate

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17)

Related Items (5)

The Kolmogorov complexity of infinite words ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal almost sure data compression
• Finite state languages
• Compression and Ranking
• Entropy and data compression schemes
• Topological Entropy
• On the entropy of context-free languages

This page was built for publication: Compression and entropy