We present some new results on the nonparametric estimation of entropy and mutual
information. First, we use an exact local expansion of the entropy function to prove almost …

We present a development of parts of rate-distortion theory and pattern-matching algorithms
for lossy data compression, centered around a lossy version of the asymptotic equipartition …

We consider two fundamental tasks in quantum information theory, data compression with
quantum side information, as well as randomness extraction against quantum side …

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 analyze the dispersions of distributed lossless source coding (the Slepian-Wolf
problem), the multiple-access channel, and the asymmetric broadcast channel. For the two …

There is a difference between the optimal rates of fixed-length source coding and intrinsic
randomness when we care about the second-order asymptotics. We prove this difference for …

This paper provides an extensive study of the behavior of the best achievable rate (and
other related fundamental limits) in variable-length strictly lossless compression. In the non …

Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and
extensive comparison between some of the most popular and effective entropy estimation …

We present a novel nonasymptotic or finite blocklength achievability bounds for three side-
information problems in network information theory. These include: 1) the Wyner-Ahlswede …

We characterize the achievable pointwise redundancy rates for lossy data compression at a
fixed distortion level." Pointwise redundancy" refers to the difference between the description …