 More specifically, the theorem says that there exist codes such that with increasing encoding length the probability of error on a discrete memoryless channel can be made arbitrarily small, provided that the code rate is smaller than the channel capacity.The code rate is defined as the fraction "k/n" of "k" source symbols and "n" encoded symbols.The actual maximum code rate allowed depends on the error-correcting code used, and may be lower.