Revision as of 00:01, 20 December 2005 edit Jheald (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 53,072 edits →Summary: + schemes ← Previous edit		Revision as of 14:17, 20 December 2005 edit undo Jheald (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 53,072 edits m →Mathematical statement: Shannon ref Next edit →
Line 37: :3. For any ''p<sub>b</sub>'', rates greater than ''R(p<sub>b</sub>)'' are not achievable. (MacKay (2003), p. 162; cf Gallager (1968), ch.5; Cover and Thomas (1991), p. 198; Shannon (1948) thm. 11) ==References==

Noisy-channel coding theorem: Difference between revisions