Precise Minimax Redundancy and Regret

DOI10.1109/TIT.2004.836702zbMath1296.94065MaRDI QIDQ3546819

Wojciech Szpankowski, Michael Drmota

Publication date: 21 December 2008

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

zbMATH Keywords

universal noiseless codingAnalytic information theoryaverage minimax redundancygeneralized Shannon codemaximum-likelihood distributionminimax and maxmin regretssequences mod 1universal modelingworst case minimax redundancy

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Related Items (4)

Online binary minimax trees ⋮ Unnamed Item ⋮ Minimax trees in linear time with applications ⋮ A lower bound on compression of unknown alphabets

This page was built for publication: Precise Minimax Redundancy and Regret