Mathematics Tripos Papers

  • Part IA
  • Part IB
  • Part II
  • FAQ

B4.13

Information Theory | Part II, 2002

Define the Huffman binary encoding procedure and prove its optimality among decipherable codes.

Typos? Please submit corrections to this page on GitHub.