Noisy-channel coding theorem: Difference between revisions

Content deleted Content added
Seblx (talk | contribs)
m Mathematical statement: removed useless "is"
Seblx (talk | contribs)
m Mathematical statement: corrected my previous modification
Line 33:
'''Theorem''' (Shannon, 1948):
 
: 1. For every discrete memoryless channel, the [[channel capacity]], defined in terms of the mutual information <math>I(X; Y)</math>, as
 
:: <math>\ C = \sup_{p_X} I(X;Y)</math><ref>For a description of the "sup" function, see [[Supremum]]</ref>