Noisy-channel coding theorem: Difference between revisions

Revision as of 10:25, 18 May 2006

Revision as of 19:21, 18 May 2006

Line 35:

::<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)=- \left[ p_b \log \left(\frac{1}{p_b}\right) + (1-p_b) \log \left(\frac{1}{1-p_b}) \right)]</math>

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