Universal redundancy rates do not exist
From MaRDI portal
Recommendations
- Universal redundancy rates for the class of B-processes do not exist
- Relative-redundancy universal coding of memoryless sources
- On bounded redundancy of universal codes
- A strong version of the redundancy-capacity theorem of universal coding
- Methods of constructing lower bounds for redundancy of universal coding
- The effect of redundancy on probability bounds
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- Universality, optimality, and randomness deficiency
- Universal data compression and repetition times
Cited in
(15)- Relative-redundancy universal coding of memoryless sources
- Minimal rates of entropy convergence for completely ergodic systems
- Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences.
- scientific article; zbMATH DE number 3427206 (Why is no real title available?)
- Markov Types and Minimax Redundancy for Markov Sources
- A One-to-One Code and Its Anti-Redundancy
- Efficient universal noiseless source codes
- scientific article; zbMATH DE number 524372 (Why is no real title available?)
- The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
- Analytic variations on redundancy rates of renewal processes
- Universal redundancy rates for the class of B-processes do not exist
- Excess entropy in natural language: present state and perspectives
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- On bounded redundancy of universal codes
- A lower-bound for the maximin redundancy in pattern coding
This page was built for publication: Universal redundancy rates do not exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202070)
