A unified approach to weak universal source coding

DOI10.1109/TIT.1978.1055960MaRDI QIDQ4177462zbMATH OpenOpenAlexFDO

Authors John C. Kieffer

Publication date 1978

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

Full work available at URL https://doi.org/10.1109/tit.1978.1055960

zbMATH Keywords

Coding a Class of Ergodic SourcesUniversal Sequence of Block CodesVariable-Rate Noiseless CodingWeak Universal Block Source Coding

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(7)

• A lower bound on compression of unknown alphabets
• A Bernstein-von Mises theorem for discrete probability distributions
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• scientific article; zbMATH DE number 3863086 (Why is no real title available?)
• Effective complexity of stationary process realizations
• scientific article; zbMATH DE number 7625180 (Why is no real title available?)
• A lower-bound for the maximin redundancy in pattern coding

This page was built for publication: A unified approach to weak universal source coding

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