Paper 3, Section I, G
What does it mean to transmit reliably at rate through a binary symmetric channel with error probability ?
Assuming Shannon's second coding theorem (also known as Shannon's noisy coding theorem), compute the supremum of all possible reliable transmission rates of a BSC. Describe qualitatively the behaviour of the capacity as varies. Your answer should address the following cases,
(i) is small,
(ii) ,
(iii) .
Typos? Please submit corrections to this page on GitHub.