Mathematics Tripos Papers

  • Part IA
  • Part IB
  • Part II
  • FAQ

Paper 1, Section I, H

Coding and Cryptography | Part II, 2018

State and prove Shannon's noiseless coding theorem. [You may use Gibbs' and Kraft's inequalities as long as they are clearly stated.]

Typos? Please submit corrections to this page on GitHub.