Alice may wish to reliably send a message to Bob over a binary symmetric channel (BSC)
while ensuring that her transmission is deniable from an eavesdropper Willie. That is, if …

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

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 …

We introduce two variants of the information spectrum relative entropy defined by
Tomamichel and Hayashi, which have the particular advantage of satisfying the data …

For any channel, the existence of a unique Augustin mean is established for any positive
order and probability mass function on the input set. The Augustin mean is shown to be the …

In real-time cyber physical systems, packetized predictive control (PPC) is an effective
solution to conduct robust control over unreliable wireless links. However, the conventional …

Among the emerging trends in the wireless industry, the Internet of Things (IoT) and machine-
to-machine (M2M) communications are notable examples that prompt power efficient …

A new upper bound on the relative entropy is derived as a function of the total variation
distance for probability measures defined on a common finite alphabet. The bound improves …

The coding problem over the Gray-Wyner network is studied from the second-order coding
rates perspective. A tilted information density for this network is introduced in the spirit of …

New upper bounds on the relative entropy are derived as a function of the total variation
distance. One bound refines an inequality by Verd\'{u} for general probability measures. A …