What this theorem actually implies is, a message when picked from \{0,1\}^k, encoded with a random encoding function E, and sent across a noisy \text{BSC}_{p}, there is a very high probability of recovering the original message by decoding, if k or in effect the rate of the channel is bounded by the quantity stated in the theorem. The decoding error probability is exponentially small.
