Noisy-channel coding theorem: Difference between revisions

Content deleted Content added
Iseetho (talk | contribs)
Iseetho (talk | contribs)
Line 82:
#Second, error can occur if an incorrect X sequence is jointly typical with a received Y sequence.
 
*By the randomness of the code construction, we can assume that the average probability of error averaged over all codes does not depend on the index sent. Thus, without loss of generality, we can assume W = 1.
 
*From the AEP, we know that the probability that no jointly typical X exists goes to 0 as n grows large. We can bound this error probability by <math>\epsilon</math>.
 
*Also from the AEP, we know the probability that a particular <math>X_1^n(i)</math> and the <math>Y_1^n</math> resulting from W = 1 are jointly typical is <math>\le 2^{-n(I(X;Y) - 3\epsilon)}</math>. Thus,
 
Define <math>E_i = \{(X_1^n(i), Y_1^n) is in A_\epsilon^{(n)}\}, i = 1, 2, ..., 2^{nR}</math> as the event that some other message i is jointly typical with the sequence received when message 1 is sent.