Information Theory and its applications in theory of computation
This note covers the following topics, Entropy, Krafts inequality, Source coding theorem, conditional entropy, mutual information, KLdivergence and connections, KLdivergence and Chernoff bounds, Data processing and Fanos inequalities, Asymptotic Equipartition Property, Universal source coding, LempelZiv 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 capacityachieving codes via concatenation, Polarization, Arikans recursive construction of a polarizing invertible transformation, Polar codes construction, Bregmans theorem, Shearers 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 2prover 1round games.
Author(s): Venkatesan
Guruswami and Mahdi Cheraghchi
NA Pages