Information Theory

Graduate Course, Imperial College London, 2024

Syllabus

This course will set out the fundamental concepts of information theory. Expressions for the information generated by discrete memoryless sources and sources with memory will be established and the lossless source coding theorem will be proved and the asymptotic equipartition theorem will be presented. The practical significance of the source coding theorem will be examined and examples of source coding will be given. The concept of channel capacity will be introduced and the calculation of the capacity of important communication channels and systems will be dealt with. The capacity theorem will be proved for various cases and its practical significance will be examined, and simple examples of coding aimed at achieving the results promised by the capacity theorem will be outlined. The concept of source coding, subject to fidelity criteria (rate distortion theory) will be introduced. Finally, the basics of network information theory will be given, which is presently the most dynamic research area in information theory.

Textbooks

Lecture Slides

Slides

Problem Sheets

Problems

Past Exam Papers

Frequently Asked Questions

  • Is topic “xyz” examinable? All topics included in the above lectures are examinable with the exception of the Kuhn Tucker conditions for constrained optimization.
  • Do I need to remember long complicated proofs? You will not be asked to reproduce long proofs from the notes. However you will be expected to understand the proofs and to justify the steps they take.
  • Do I need to remember long formulas? In general you are not expected to memorize long complicated formulas. However you will be expected to remember some basic and important formulas.