On bounded redundancy of universal codes

DOI10.1016/J.SPL.2012.07.007zbMath1260.94032OpenAlexW2038485165MaRDI QIDQ712553

Łukasz Dębowski

Publication date: 17 October 2012

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2012.07.007

zbMATH Keywords

entropyergodic decompositionuniquely decodable codes

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Entropy and other invariants (28D20) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10)

Cites Work

• Unnamed Item
• A general definition of conditional information and its application to ergodic decomposition
• A universal algorithm for sequential data compression
• A definition of conditional mutual information for arbitrary ensembles
• Universal redundancy rates do not exist
• Foundations of Modern Probability
• Grammar-based codes: a new class of universal lossless source codes
• On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
• Elements of Information Theory
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: On bounded redundancy of universal codes