 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.