<?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="Berlekamp&#039;s algorithm - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Berlekamp's_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Berlekamp%27s_algorithm&amp;p=6">3.Next</a>
</p>
<p>the above result by computing a basis for the Berlekamp subalgebra.  This is achieved via the observation that Berlekamp subalgebra is in fact the <a href="page.php?w=kernel_%28linear_algebra%29">kernel</a> of a certain  matrix over , which is derived from the so-called Berlekamp matrix of the polynomial, denoted .  If  then  is the coefficient of the -th power term in the reduction of  modulo , i.e.:</p>

<p>
:</p>

<p>With a certain polynomial , say:</p>

<p>
:</p>

<p>we may associate the row vector:</p>

<p>
:</p>

<p>It is relatively straightforward</p><p>
<a accesskey="1" href="page.php?w=Berlekamp's_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Berlekamp%27s_algorithm&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
