The error probability, entropy, and equivocation when the number of input messages increases

We derive an inequality for the minimum error probability which shows that in many situations this quantity converges to its supremum as the number of possible values of the input signal increases. The asymptotic behavior of this probability is related to the behavior of the equivocation. Implications for asymptotic rates of certain codes and for perfect secrecy of cryptosystems are mentioned.