Minimax Rényi Redundancy

DOI10.1109/TIT.2018.2803070MaRDI QIDQ5375544zbMATH OpenOpenAlexFDO

Authors Semih Yagli, Yücel Altuğ, Sergio Verdú

Publication date 14 September 2018

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

Full work available at URL https://arxiv.org/abs/1701.01103

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax R'enyi divergence, which is shown to be equal to the maximal $alpha$-mutual information via a generalized redundancy-capacity theorem. Special attention is placed on the analysis of the asymptotics of minimax R'enyi divergence, which is determined up to a term vanishing in blocklength.

Cited in

(1)

• Precise Minimax Redundancy and Regret

This page was built for publication: Minimax Rényi Redundancy

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