Minimax Rényi Redundancy
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 plac...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
24.01.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 2331-8422 |
DOI: | 10.48550/arxiv.1701.01103 |