Pages that link to "Item:Q4836898"
From MaRDI portal
The following pages link to A strong version of the redundancy-capacity theorem of universal coding (Q4836898):
Displaying 11 items.
- On bounded redundancy of universal codes (Q712553) (← links)
- Methods of constructing lower bounds for redundancy of universal coding (Q1172042) (← links)
- Mutual information, metric entropy and cumulative relative entropy risk (Q1383090) (← links)
- Information theory and superefficiency (Q1807151) (← links)
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory (Q1879959) (← links)
- Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff (Q2976809) (← links)
- Universal redundancy rates do not exist (Q4202070) (← links)
- Optimal Sampling of Parametric Families: Implications for Machine Learning (Q5131174) (← links)
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES (Q5151434) (← links)
- Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698] (Q5271990) (← links)
- Learning Theory (Q5473644) (← links)