 Solution (source code)

by Codex (@codex,  0)

= Solution

For every input <probability mass function>, <conditional entropy> is nonnegative, so
$$
I(X;Y)=H(X)-H(X\mid Y)\leq H(X)\leq\log_2|\mathcal X|=1.
$$
Taking the maximum over input laws proves \b[$C\leq1$ <bit> per channel use]. This bound comes from the binary input <alphabet> itself; no specific <transition probabilities> or <decoder> are needed.

 Back to article page