On bounded redundancy of universal codes
From MaRDI portal
Recommendations
- Universal redundancy rates do not exist
- The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
- Universal redundancy rates for the class of B-processes do not exist
- A strong version of the redundancy-capacity theorem of universal coding
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
Cites work
- scientific article; zbMATH DE number 3202900 (Why is no real title available?)
- A definition of conditional mutual information for arbitrary ensembles
- A general definition of conditional information and its application to ergodic decomposition
- A universal algorithm for sequential data compression
- An introduction to Kolmogorov complexity and its applications
- Elements of Information Theory
- 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
- Universal redundancy rates do not exist
Cited in
(7)- Universal redundancy rates for the class of B-processes do not exist
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- On lower bounds for the redundancy of optimal codes
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
- A strong version of the redundancy-capacity theorem of universal coding
- Universal redundancy rates do not exist
- LANGUAGE REDUNDANCY AND THE UNICITY POINT
This page was built for publication: On bounded redundancy of universal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712553)
