A strong version of the redundancy-capacity theorem of universal coding

DOI10.1109/18.382017zbMath0821.94020OpenAlexW2148861585MaRDI QIDQ4836898

Neri Merhav, Meir Feder

Publication date: 25 September 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/298a031a2970ab2d077f765a3e5e4a4b63801477

zbMATH Keywords

redundancyuniversal codingchannel capacity

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (4)

Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory ⋮ Mutual information, metric entropy and cumulative relative entropy risk ⋮ Optimal Sampling of Parametric Families: Implications for Machine Learning ⋮ Information theory and superefficiency

This page was built for publication: A strong version of the redundancy-capacity theorem of universal coding