Example: Channel capacity

Problem: A binary source sends ? equiprobable messages in a time T, using the alphabet {0, 1} with a symbol rate R. As a result of noise, a “0” may be mistaken for a “1”, and a “1” for a “0”, both with probability q. What is the channel capacity C?

Note 1: This example is called a binary symmetric channel

Note 2: This result is incorrectly labeled “Shannon’s Theorem” on p. 106 of the Feynman text

X

Y

Channel is discrete

and memoryless

Previous slide

Next slide

Back to first slide

View graphic version