Noisy-channel coding theorem: Difference between revisions

Revision as of 20:08, 17 May 2006

Revision as of 04:44, 18 May 2006

Line 44:

== Outline of Proof ==

{{section-stub}}

As with several other major results in information theory, the proof of the noisy channel coding theorem includes an achievability result and a matching converse result. These two components serve to bound, in this case, the set of possible rates at which one can communicate over a noisy channel, and matching serves to show that these bounds are tight bounds.