DocumentCode :
915460
Title :
On the mutual information of memoryless channels
Author :
Kadota, T.T.
Volume :
17
Issue :
2
fYear :
1971
fDate :
3/1/1971 12:00:00 AM
Firstpage :
140
Lastpage :
143
Abstract :
Let 
and 
be input and output sequences of a channel. In the case of memoryless input sources, the following inequality on mutual information is well known: begin{equation} I((x_1, cdots ,x_n),(y_1, cdots ,y_n)) geq sum I(x_i, y_i). end{equation} It is straightforward to show that the inequality sign is reversed if the channel instead of the input source is memoryless. In this paper we establish these inequalities when the input and output are functions instead of sequences.
and be input and output sequences of a channel. In the case of memoryless input sources, the following inequality on mutual information is well known: begin{equation} I((x_1, cdots ,x_n),(y_1, cdots ,y_n)) geq sum I(x_i, y_i). end{equation} It is straightforward to show that the inequality sign is reversed if the channel instead of the input source is memoryless. In this paper we establish these inequalities when the input and output are functions instead of sequences.Keywords :
Memoryless channels; Mutual information; Codes; Detectors; Memoryless systems; Mutual information; Telephony; Testing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054611
Filename :
1054611
Link To Document :
