<?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 15 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=14">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=16">3.Next</a>
</p>
<p>also assumed that one knows the transition matrix  for the channel being used.<br/>
# A message W is chosen according to the uniform distribution on the set of codewords.  That is, .<br/>
# The message W is sent across the channel.<br/>
# The receiver receives a sequence according to <br/>
# Sending these codewords across the channel, we receive , and decode to some source sequence if there exists exactly 1 codeword that is jointly typical with Y.  If there are no jointly typical codewords, or if there are more than one, an error is declared.</p><p>
<a accesskey="1" href="page.php?w=Noisy-channel_coding_theorem&amp;p=14">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Noisy-channel_coding_theorem&amp;p=16">3.Next</a>
</p>

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

</card>
</wml>
