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 Resultsby 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.
(5103 views)
Data Compression- Wikibooks
Data compression is useful in some situations because 'compressed data' will save time (in reading and on transmission) and space if compared to the unencoded information it represent. In this book, we describe the decompressor first.
(8089 views)
Theory of Quantum Informationby John Watrous - University of Calgary
The focus is on the mathematical theory of quantum information. We will begin with basic principles and methods for reasoning about quantum information, and then move on to a discussion of various results concerning quantum information.
(10216 views)
Algorithmic Information Theoryby Peter D. Gruenwald, Paul M.B. Vitanyi - CWI
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain this quantitative approach to defining information and discuss the extent to which Kolmogorov's and Shannon's theory have a common purpose.
(9291 views)