We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z.

Smooth Rényi entropy quantifies the amount of extractable uniform randomness, up to some small additive constant. Theorem II.1 For any set P of probability ...

We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z, such as the amount ...

We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z.

Oct 22, 2018 · It is shown that our definition of the conditional smooth Renyi entropy is appropriate to give lower and upper bounds on the optimal guessing ...

Mar 11, 2020 · Using these smooth Rényi entropies, we establish one-shot coding theorems of several information-theoretic problems: Campbell's source coding, ...

We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z, such as the amount ...

In this paper we extend the study of smooth Rényi entropy to the more general class of stationary, ergodic sources rather than memoryless sources. We will prove ...

Abstract Smooth Rényi entropies are defined as optimizations (either minimizations or maximization) of Rényi entropies over a set of close states.

The results have applications in cryptography for unconditionally secure protocols such as quantum key agreement, key agreement from correlated information, ...