Discrete Memoryless Channel (DMC) which has
ie
Lemma
Let
as
Proof
Let
by weak law of large numbers.
Proposition
The capacity of a Binary Symmetric Channel (BSC) with error probability
Proof
Choose
We prove reliable encoding at rate
Let
??????????? RACHEL PLEASE STOP HIDING YOUR BLACKBOARDS!!!!
12 ferburary lecture
Replacing
Using minimum distance decoding
Pick
Then
Therefore
as