Noisy-channel Coding Theorem - Outline of Proof

Outline of Proof

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.

The following outlines are only one set of many different styles available for study in information theory texts.

Read more about this topic:  Noisy-channel Coding Theorem

Famous quotes containing the words outline of, outline and/or proof:

    One by one objects are defined—
    It quickens: clarity, outline of leaf

    But now the stark dignity of
    entrance—Still, the profound change
    has come upon them: rooted, they
    grip down and begin to awaken
    William Carlos Williams (1883–1963)

    One by one objects are defined—
    It quickens: clarity, outline of leaf

    But now the stark dignity of
    entrance—Still, the profound change
    has come upon them: rooted, they
    grip down and begin to awaken
    William Carlos Williams (1883–1963)

    Right and proof are two crutches for everything bent and crooked that limps along.
    Franz Grillparzer (1791–1872)