The design of block codes for short information blocks (eg, a thousand or less information
bits) is an open research problem that is gaining relevance thanks to emerging applications …

This paper investigates the maximal secret communication rate over a wiretap channel
subject to reliability and secrecy constraints at a given blocklength. New achievability and …

A variety of new measures of quantum Rényi mutual information and quantum Rényi
conditional entropy have recently been proposed, and some of their mathematical properties …

This paper gives upper and lower bounds on the minimum error probability of Bayesian M-
ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order …

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability
and secrecy constraints at a given blocklength. New achievability and converse bounds are …

We propose a saddlepoint approximation of the error probability of a binary hypothesis test
between two iid distributions. The approximation is accurate, simple to compute, and yields …

Strong converse theorems refer to the study of impossibility results in information theory. In
particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum …

We provide a tight asymptotic characterization of the error exponent for classical-quantum
channel coding assisted by activated non-signaling correlations. Namely, we find that the …

A central question in information theory is to determine the maximum success probability
that can be achieved in sending a fixed number of messages over a noisy channel. This was …

Information-theoretic stealth attacks are data injection attacks that minimize the amount of
information acquired by the operator about the state variables, while simultaneously limiting …