A Shannon-McMillan theorem for motley names

DOI10.1007/BF02937306MaRDI QIDQ2644796zbMATH OpenFDO

Authors James Propp

Publication date 1990

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02937306

zbMATH Keywords

entropy constraintsfactor mapsmotley namespartitionrandomly constructed codesShannon-McMillan theorem

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Recommendations

• The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem
• scientific article; zbMATH DE number 1094122
• scientific article; zbMATH DE number 1234984
• Generalizations of Shannon-McMillan theorem
• The entropy theorem via coding bounds

Cites work

• A Mathematical Theory of Communication
• The Basic Theorems of Information Theory

Cited in

(4)

• Coding Markov chains from the past
• Toric partial orders
• Measures of full dimension on affine-invariant sets
• On the rule of \(k\) names

This page was built for publication: A Shannon-McMillan theorem for motley names

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644796)