Revision as of 00:00, 19 May 2006 edit Iseetho (talk \| contribs) 22 edits →Achievability for discrete memoryless channels ← Previous edit		Revision as of 00:06, 19 May 2006 edit undo Iseetho (talk \| contribs) 22 edits →Converse for discrete memoryless channels Next edit →
Line 109: #<math>\le 1 + P_e^{(n)}nR + nC</math> by the fact that capacity is maximized mutual information. The result of these steps is that <math> P_e^{(n)} \lege 1 - \frac{1}{nR} - \frac{C}{R} </math>. As the block length n goes to infinity, we obtain <math> P_e^{(n)}</math> is bounded away from 0 if R is greater than C - we can only get arbitrarily low rates of error if R is less than C. == Channel coding theorem for non-stationary memoryless channels==

Noisy-channel coding theorem: Difference between revisions