This paper develops systematic approaches to obtain f-divergence inequalities, dealing with
pairs of probability measures defined on arbitrary alphabets. Functional domination is one …

The conventional channel resolvability problem refers to the determination of the minimum
rate required for an input process so that the output distribution approximates a target …

We use a Rényi entropy method to prove strong converse theorems for certain information-
theoretic tasks which involve local operations and quantum (or classical) communication …

Rényi's information measures-the Rényi information, mean, capacity, radius, and center-are
analyzed relying on the elementary properties of the Rényi divergence and the power …

In this paper, we consider single-and multi-user Gaussian channels with feedback under
expected power constraints and with non-vanishing error probabilities. In the first of two …

This paper starts by considering the minimization of the Rényi divergence subject to a
constraint on the total variation distance. Based on the solution of this optimization problem …

A sphere packing bound (SPB) with a prefactor that is polynomial in the block length is
established for codes on a length product channel, assuming that the maximum order 1/2 …

Motivated by a horse betting problem, a new conditional Rényi divergence is introduced. It is
compared with the conditional Rényi divergences that appear in the definitions of the …

This dissertation investigates relative entropies, also called generalized divergences, and
how they can be used to characterize information-theoretic tasks in quantum information …

This paper studies bounds among various f-divergences, dealing with arbitrary alphabets
and deriving bounds on the ratios of various distance measures. Special attention is placed …