<?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 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Berlekamp's_algorithm&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Berlekamp%27s_algorithm&amp;p=4">3.Next</a>
</p>
<p>coefficients in the same field such that  divides .  The algorithm may then be applied recursively to these and subsequent divisors, until we find the decomposition of  into powers of <a href="page.php?w=irreducible_polynomial">irreducible polynomial</a>s (recalling that the <a href="page.php?w=ring_%28mathematics%29">ring</a> of polynomials over a finite field is a <a href="page.php?w=unique_factorization_domain">unique factorization domain</a>).</p>

<p>All possible factors of  are contained within the <a href="page.php?w=factor_ring">factor ring</a><br/></p><p>
<a accesskey="1" href="page.php?w=Berlekamp's_algorithm&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Berlekamp%27s_algorithm&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
