Noisy-channel coding theorem: Difference between revisions

Content deleted Content added
References: | Alter: template type. Add: pages, issue, volume, journal, year, title, doi, url, authors 1-1. Removed proxy/dead URL that duplicated identifier. | Use this tool. Report bugs. | #UCB_Gadget
removed "For" to correct grammar of a sentence
Tag: Reverted
Line 33:
'''Theorem''' (Shannon, 1948):
 
: 1. For everyEvery 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>