Title :
The error probability, entropy, and equivocation when the number of input messages increases
Author :
Rukhin, Andrew L. ; Vajda, Igor
Author_Institution :
Dept. of Math. & Stat., UMBC, Baltimore, MD, USA
fDate :
11/1/1996 12:00:00 AM
Abstract :
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
Keywords :
channel coding; codes; convergence; cryptography; entropy; error statistics; minimisation; probability; sequences; telecommunication channels; asymptotic behavior; asymptotic rates; codes; cryptosystems; entropy; equivocation; error probability; input messages; input signal; minimum error probability; secrecy; Block codes; Convolution; Convolutional codes; Cryptography; Entropy; Error probability; Feedback; Information theory; Maximum likelihood decoding; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
