DocumentCode
1087026
Title
A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels
Author
Balakirsky, Vladimir B.
Author_Institution
Dept. of Inf. Theory, Lund Univ., Sweden
Volume
41
Issue
6
fYear
1995
fDate
11/1/1995 12:00:00 AM
Firstpage
1889
Lastpage
1902
Abstract
An upper bound on the maximal transmission rate over binary-input memoryless channels, provided that the decoding decision rule is given, is derived. If the decision rule is equivalent to the maximum-likelihood decoding (matched decoding), then the bound coincides with the channel capacity. Otherwise (mismatched decoding), it coincides with a known lower bound
Keywords
channel capacity; decision theory; maximum likelihood decoding; memoryless systems; binary-input memoryless channels; channel capacity; converse coding theorem; decoding decision rule; lower bound; matched decoding; maximal transmission rate; maximum-likelihood decoding; mismatched decoding; output; Block codes; Channel capacity; Conferences; Data security; Information theory; Maximum likelihood decoding; Memoryless systems; Probability distribution; Scholarships; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.476314
Filename
476314
Link To Document