Paper 1, Section I\mathbf{I}, H

Coding \& 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.]