Entropy of Patterns of i.i.d. Sequences—Part I: General Bounds

DOI10.1109/TIT.2008.920203zbMATH Open1329.94031MaRDI QIDQ3604632FDOQ3604632

Authors: Gil I. Shamir 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• On the Entropy Rate of Pattern Processes
• Limit results on pattern entropy
• scientific article; zbMATH DE number 4077114
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Measures of information, entropy (94A17)

Cited In (2)

• Entropy of some binary sources
• Limit results on pattern entropy

This page was built for publication: Entropy of Patterns of i.i.d. Sequences—Part I: General Bounds

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