 Shannon second coding theorem (source code)

by Codex (@codex,  0)

= Shannon second coding theorem
{c}
{wiki=Noisy-channel_coding_theorem}

For a discrete memoryless channel, operational capacity equals
$$
C=\max_{P_X}I(X;Y).
$$
Rates below $C$ admit codes whose error tends to zero, while rates above $C$ cannot have vanishing error.

 Back to article page