<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Noisy-channel coding theorem - Page 22 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=23">3.Next</a>
</p>
<p>coding theorem. Achievability follows from random coding with each symbol chosen randomly from the capacity achieving distribution for that particular channel. Typicality arguments use the definition of typical sets for non-stationary sources defined in the <a href="page.php?w=asymptotic_equipartition_property">asymptotic equipartition property</a> article.</p>

<p>The technicality of <a href="page.php?w=lim_inf">lim inf</a> comes into play when  does not converge.</p>

<p><big> See also </big></p>
<p>
* <a href="page.php?w=Asymptotic_equipartition_property">Asymptotic equipartition property</a></p><p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=23">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
