Paper 1, Section II, H
State and prove Shannon's theorem for the capacity of a noisy memoryless binary symmetric channel, defining the terms you use.
[You may make use of any form of Stirling's formula and any standard theorems from probability, provided that you state them exactly.]
Typos? Please submit corrections to this page on GitHub.