Shannon 1948: noisy-channel coding theorem establishes capacity C = max_p(x) I(X;Y) as fundamental limit; rate < C achievable, rate > C impossible.
Shannon 1948: noisy-channel coding theorem establishes capacity C = max_p(x) I(X;Y) as fundamental limit; rate < C achievable, rate > C impossible.