Revision as of 23:09, 19 December 2005 edit Jheald (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 53,072 edits Separated from Shannon-Hartley theorem		Revision as of 23:11, 19 December 2005 edit undo Jheald (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 53,072 edits m →Summary Next edit →
Line 17: :<math> R \ge C </math> the probability of error at the receiver increases without bound ifas the transmission rate is increased. No useful information can be transmitted beyond the channel capacity. == Mathematical statement ==

Noisy-channel coding theorem: Difference between revisions