This article surveys all known fields of network coding theory and leads the reader through
the antecedents of the network coding theory to the most recent results, considering also …

This book is an evolution from my book A First Course in Information Theory published in
2002 when network coding was still at its infancy. The last few years have witnessed the …

A First Course in Information Theory is an up-to-date introduction to information theory. In
addition to the classical topics discussed, it provides the first comprehensive treatment of the …

Given n discrete random variables/spl Omega/={X/sub 1/,/spl middot//spl middot//spl middot/,
X/sub n/}, associated with any subset/spl alpha/of (1, 2,/spl middot//spl middot//spl middot …

We present a framework for information inequalities, namely, inequalities involving only
Shannon's information measures, for discrete random variables. A region in IR (2/sup n/-1) …

We establish a one-to-one correspondence between information inequalities and group
inequalities. The major implication of our result is that we can prove information inequalities …

We study the problem of source coding with multiple descriptions, which is described as
follows. Let X be a discrete memoryless source. There are two encoders, Encoders 1 and 2 …

The authors present theorems that lead to a new combinatorial approach to prove
information inequality. The non-negativity of Shannon's information measures can all be …

In this correspondence, we are interested in linear information inequalities, both discrete
and continuous ones. We show that every discrete information inequality is associated with …

We study dynamical reversibility in stationary stochastic processes from an information-
theoretic perspective. Extending earlier work on the reversibility of Markov chains, we focus …