Hierarchical universal coding

DOI10.1109/18.532877MaRDI QIDQ4896814zbMATH OpenOpenAlexFDO

Authors Meir Feder, Neri Merhav

Publication date 28 April 1997

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

Full work available at URL https://doi.org/10.1109/18.532877

zbMATH Keywords

hierarchical structures of classesminimax redundancyredundancy-capacity theoremuniversal coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• A strong version of the redundancy-capacity theorem of universal coding
• Universal sequential coding of single messages
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• Universal noiseless coding

Cited in

(4)

• Mixing strategies for density estimation.
• The Uniform Distribution as a Universal Prior
• On Hierarchical Type Covering
• Hierarchical Unambiguity

This page was built for publication: Hierarchical universal coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896814)