A Shannon-McMillan theorem for motley names
From MaRDI portal
Publication:2644796
DOI10.1007/BF02937306zbMath0724.28010MaRDI QIDQ2644796
Publication date: 1990
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
partitionShannon-McMillan theoremfactor mapsentropy constraintsmotley namesrandomly constructed codes
Entropy and other invariants (28D20) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)
Related Items (3)
Measures of full dimension on affine-invariant sets ⋮ Coding Markov chains from the past ⋮ Toric partial orders
Cites Work
This page was built for publication: A Shannon-McMillan theorem for motley names