DocumentCode
1316038
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
Volume
42
Issue
6
fYear
1996
fDate
11/1/1996 12:00:00 AM
Firstpage
2228
Lastpage
2231
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.556611
Filename
556611
Link To Document