Minimax R\'enyi Redundancy
Information Theory
2019-03-12 v4 math.IT
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 -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.
Keywords
Cite
@article{arxiv.1701.01103,
title = {Minimax R\'enyi Redundancy},
author = {Semih Yagli and Yücel Altuğ and Sergio Verdú},
journal= {arXiv preprint arXiv:1701.01103},
year = {2019}
}
Comments
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