Minimax redundancy for the class of memoryless sources

DOI10.1109/18.556120zbMath0872.94017OpenAlexW2114874848MaRDI QIDQ4340333

Andrew R. Barron, Qun Xie

Publication date: 10 June 1997

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

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

zbMATH Keywords

Jeffreys' priormemoryless sourceuniversal noiseless codingasymptotic least favorable priorminimax redundancy minusminimax total relative entropy risk

Mathematics Subject Classification ID

Source coding (94A29)

Related Items

Information optimality and Bayesian modelling ⋮ Predicting a binary sequence almost as well as the optimal biased coin ⋮ Asymptotically minimax Bayesian predictive densities for multinomial models ⋮ Nonsubjective priors via predictive relative entropy regret ⋮ Relative expected instantaneous loss bounds

This page was built for publication: Minimax redundancy for the class of memoryless sources