Shannon second coding theorem

For a discrete memoryless channel, operational capacity equalsRates below $C$ admit codes whose error tends to zero, while rates above $C$ cannot have vanishing error.

A rate $R$ is reliably achievable through a channel when there is a sequence of length-$n$ channel codes with $M_n$ messages such thatand their decoding-error probability tends to zero.