Lecture notes on Information Theory and Coding

An introduction to information Theory and Entropy

This note covers Measuring complexity, Some probability ideas, Basics of information theory, Some entropy theory, The Gibbs inequality, A simple physical example Shannon’s communication theory, Application to Biology, Examples using Bayes Theorem, Analog channels, A Maximum Entropy Principle, Application to Physics(lasers), Kullback-Leibler information measure.

Author(s): Tom Carter

139 Pages

Information Theory by Y. Polyanskiy

This PDF covers the following topics related to Information Theory : Information measures, Lossless data compression, Binary hypothesis testing, Channel coding, Lossy data compression, Advanced topics.

Author(s): Y. Polyanskiy, Y. Wu

295 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 in Computer Science

This note explains the following topics: Shearer's Lemma, Entropy, Relative Entropy, Hypothesis testing, total variation distance and Pinsker's lemma, Stability in Shearer's Lemma, Communication Complexity, Set Disjointness, Direct Sum in Communication Complexity and Internal Information Complexity, Data Structure Lower Bounds via Communication Complexity, Algorithmic Lovasz Local Lemma, Parallel Repetition Theorem, Graph Entropy and Sorting.

Author(s): Madhu Sudan

NA Pages

Information Theory by Yao Xie

This note will explore the basic concepts of information theory. It is highly recommended for students planning to delve into the fields of communications, data compression, and statistical signal processing. Topics covered includes: Entropy and mutual information, Chain rules and inequalities, Data processing, Fano's inequality, Asymptotic equipartition property, Entropy rate, Source coding and Kraft inequality, Optimal code length and roof code, Huffman codes, Shannon-Fano-Elias and arithmetic codes, Maximum entropy, Channel capacity, Channel coding theorem, Differential entropy, Gaussian channel, Parallel Gaussian channel and water-filling, Quantization and rate-distortion.

Author(s): Yao Xie

NA Pages

A Short Course in Information Theory (D. MacKay)

Currently this section contains no detailed description for the page, will update this page soon.

Author(s):

Pages