Noisy-channel coding theorem: Difference between revisions

Revision as of 11:11, 20 June 2020

Revision as of 09:07, 27 June 2020

Line 33:

'''Theorem''' (Shannon, 1948):

:1. For every discrete memoryless channel, the [[channel capacity]] is defined in terms of the mutual information <math>I(X,; Y)</math>,

::<math>\ C = \sup_{p_X} I(X;Y)</math><ref>For a description of the "sup" function, see [[Supremum]]</ref>