A strong version of the redundancy-capacity theorem of universal coding
From MaRDI portal
Recommendations
- On bounded redundancy of universal codes
- Strong universal source coding subject to a rate-distortion constraint
- Methods of constructing lower bounds for redundancy of universal coding
- Relative-redundancy universal coding of memoryless sources
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- scientific article; zbMATH DE number 976133
- The entropy theorem via coding bounds
- A Unified Random Coding Bound
- scientific article; zbMATH DE number 4193602
- A note on coding theorems of information theory
Cited in
(17)- Methods of constructing lower bounds for redundancy of universal coding
- Mutual information, metric entropy and cumulative relative entropy risk
- Information theory and superefficiency
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
- The Uniform Distribution as a Universal Prior
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- Universal redundancy rates do not exist
- scientific article; zbMATH DE number 524372 (Why is no real title available?)
- Bounds on achievable convergence rates of parameter estimators via universal coding
- Lower bounds on expected redundancy for nonparametric classes
- Hierarchical universal coding
- Optimal sampling of parametric families: implications for machine learning
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698]
- Learning Theory
- On bounded redundancy of universal codes
This page was built for publication: A strong version of the redundancy-capacity theorem of universal coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836898)
