Compression and entropy
From MaRDI portal
Publication:5096807
DOI10.1007/3-540-55210-3_209zbMath1494.68080MaRDI 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
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A17: Measures of information, entropy
Related Items
Deciding regularity of hairpin completions of regular languages in polynomial time, Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups, Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields, The Kolmogorov complexity of infinite words, Information rate of some classes of non-regular languages: an automata-theoretic approach
Cites Work