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 …

Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

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 …

This comprehensive text on entropy covers three major types of dynamics: measure
preserving transformations; continuous maps on compact spaces; and operators on function …

A central question for causal inference is to decide whether a set of correlations fits a given
causal structure. In general, this decision problem is computationally infeasible and hence …

We define a class of networks, called matroidal networks, which includes as special cases
all scalar-linearly solvable networks, and in particular solvable multicast networks. We then …

When finite, Shannon entropies of all sub vectors of a random vector are considered for the
coordinates of an entropic point in Euclidean space. A linear combination of the coordinates …

An outer bound on the rate region of noise-free information networks is given. This outer
bound combines properties of entropy with a strong information inequality derived from the …

We show via explicit construction that all the extreme rays of both the three-party quantum
entropy cone and the four-party stabilizer entropy cone can be obtained from subsystem …

All unconstrained information inequalities in three or fewer random variables are known to
be" Shannon-type", in that they are nonnegative linear combinations of instances of the …