**Lecture Notes on Network Information Theory**

by Abbas El Gamal, Young-Han Kim

**Publisher**: arXiv 2010**Number of pages**: 640

**Description**:

Network information theory deals with the fundamental limits on information flow in networks and optimal coding techniques and protocols that achieve these limits. This set of lecture notes aims to provide a broad coverage of key results, techniques, and open problems in network information theory.

Download or read it online for free here:

**Download link**

(4.7MB, PDF)

## Similar books

**Around Kolmogorov Complexity: Basic Notions and Results**

by

**Alexander Shen**-

**arXiv.org**

Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.

(

**1936**views)

**Information-Theoretic Incompleteness**

by

**Gregory J. Chaitin**-

**World Scientific**

In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a non-technical discussion of its significance. The technical survey contains many new results, including a detailed discussion of LISP program size.

(

**6077**views)

**The Limits of Mathematics**

by

**Gregory J. Chaitin**-

**Springer**

The final version of a course on algorithmic information theory and the epistemology of mathematics. The book discusses the nature of mathematics in the light of information theory, and sustains the thesis that mathematics is quasi-empirical.

(

**7855**views)

**A Short Course in Information Theory**

by

**David J. C. MacKay**-

**University of Cambridge**

This text discusses the theorems of Claude Shannon, starting from the source coding theorem, and culminating in the noisy channel coding theorem. Along the way we will study simple examples of codes for data compression and error correction.

(

**8823**views)