Minimax Rényi Redundancy

Abstract

The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax Rényi 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ényi divergence, which is determined up to a term vanishing in blocklength.

Double-column, 19 pages, submitted for publication to IEEE Transactions on Information Theory. Disclaimer: the published version may have slight variations. Part of this work appeared in ISIT '17

References in corpus (1)

• Guessing under source uncertainty

Cited by in corpus (1)

• A precise bare simulation approach to the minimization of some distances. Foundations