Content deleted Content added
Line 63:
:::<math>2^{-n(H(X,Y) + \epsilon)} \le p(X_1^n, Y_1^n) \le 2^{-n(H(X,Y) -\epsilon)} \}</math>
We say that two sequences <math>X_1^n</math> and <math>Y_1^n</math> are ''jointly typical'' if they lie in the jointly typical set defined above.
'''Steps'''
Line 70 ⟶ 72:
#The message W is sent across the channel.
#The receiver receives a sequence according to <math>P(y^n|x^n(w))= \prod_{i = 1}^np(y_i|x_i(w))</math>
#Sending these codewords across the channel, we receive <math>Y_1^n</math>, and decode to some source sequence if there exists exactly 1 codeword that is jointly typical
| |||