Advertisement
Lecture Notes On Information Theory
These notes provide a graduate-level introduction to the mathematics of Information Theory. Topics covered includes: Information measures: entropy, divergence and mutual information, Sufficient statistic, Extremization of mutual information, Lossless data compression, Channel coding, Linear codes, Lossy data compression, Applications to statistical decision theory, Multiple-access channel, Entropy method in combinatorics and geometry.
Author(s): Yihong Wu
342 Pages 
Information Theory and its applications in theory of computation
This note covers the following topics: Entropy, Kraft's inequality, Source coding theorem, conditional entropy, mutual information, KL-divergence and connections, KL-divergence and Chernoff bounds, Data processing and Fano's inequalities, Asymptotic Equipartition Property, Universal source coding: Lempel-Ziv algorithm and proof of its optimality, Source coding via typical sets and universality, joint typicality and joint AEP, discrete channels and channel capacity, Proof of Noisy channel coding theorem, Constructing capacity-achieving codes via concatenation, Polarization, Arikan's recursive construction of a polarizing invertible transformation, Polar codes construction, Bregman's theorem, Shearer's Lemma and applications, Source coding and Graph entropy, Monotone formula lower bounds via graph entropy, Optimal set Disjointness lower bound and applications, Compression of arbitrary communication protocols, Parallel repetition of 2-prover 1-round games.
Author(s): Venkatesan Guruswami and Mahdi Cheraghchi
NA Pages
Information Theory, Inference, and Learning Algorithms (David J.C. MacKay)
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
