<?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 20 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=19">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=21">3.Next</a>
</p>
<p>the strong converse states that the error goes to 1. Thus,  is a sharp threshold between perfectly reliable and completely unreliable communication.</p>

<p><big> Finite-blocklength refinements </big></p>
<p>Finite-blocklength refinements of the noisy-channel coding theorem study the best coding rate at a fixed block length, rather than only the limiting capacity. Masahito Hayashi used the information-spectrum method to derive second-order coding-rate formulas for channel coding, including stationary memoryless channels and additive Markovian channels.</p><p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=19">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=21">3.Next</a>
</p>

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

</card>
</wml>
