Given two random variables X and Y, an operational approach is undertaken to quantify the
“leakage” of information from X to Y. The resulting measure L (X→ Y) is called maximal …

This monograph presents a unified treatment of single-and multi-user problems in
Shannon's information theory where we depart from the requirement that the error …

This paper shows that, under the average error probability formalism, the third-order term in
the normal approximation for the additive white Gaussian noise channel with a maximal or …

This paper considers the problem of channel coding with a given (possibly suboptimal)
maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple …

We consider block codes whose rate converges to the channel capacity with increasing
blocklength at a certain speed and examine the best possible decay of the probability of …

In recent years, the derivation of nonasymptotic converse and achievability bounds on the
maximum coding rate as a function of the error probability and blocklength has gained …

Data publishing under privacy constraints can be achieved with mechanisms that add
randomness to data points when released to an untrusted party, thereby decreasing the …

As sensing, control, and actuation become further integrated into modern communication
infrastructures, special consideration must be given to the type of traffic generated by …

Saddlepoint approximations of the meta-converse and random-coding union bounds are
derived. These bounds accurately characterize the channel coding minimum error …

We study lower bounds on the optimal error probability in classical coding over classical-
quantum channels at rates below the capacity, commonly termed quantum sphere-packing …