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.
Original language | English (US) |
---|---|
Pages (from-to) | 3715-3733 |
Number of pages | 19 |
Journal | IEEE Transactions on Information Theory |
Volume | 64 |
Issue number | 5 |
DOIs | |
State | Published - May 2018 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Jeffreys' prior
- Rényi divergence
- Universal lossless compression
- generalized redundancy-capacity theorem
- minimax redundancy
- minimax regret
- risk aversion
- α-mutual information