Lecture Notes on Network Information Theory
by Abbas El Gamal, Young-Han Kim
Publisher: arXiv 2010
Number of pages: 640
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.
Home page url
Download or read it online for free here:
by Gregory J. Chaitin - World Scientic
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.
by 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.
by Gregory J. Chaitin - Springer
This book presents the core of Chaitin's theory of program-size complexity, also known as algorithmic information theory. LISP is used to present the key algorithms and to enable computer users to interact with the author's proofs.
by Martin Tomlinson, et al. - Springer
This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies.