Noisy-channel coding theorem: Difference between revisions

Revision as of 13:19, 23 January 2006

Revision as of 11:06, 30 March 2006

Line 34:

::<math>R(p_b) = \frac{C}{1-H_2(p_b)} .</math>

:and <math>H_2(p_b)</math> is the ''binary entropy function''

::<math>H_2(p_b)=p_b \log(\frac{1}{p_b}) + (1-p_b) \log(\frac{1}{1-p_b})</math>

:3. For any ''p_b'', rates greater than ''R(p_b)'' are not achievable.