Berlekamp–Massey algorithm: Difference between revisions

Revision as of 01:58, 17 October 2023

Revision as of 09:54, 19 October 2023

Line 103:

-->

<div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr">

<span></span><span class="n">polynomial</span><span class="p">(</span><span class="n">field</span><span class="w"> </span><span class="n">K</span><span class="p">)</span><span class="w"> </span><span class="n">s</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">...</span><span class="w"> </span><span class="cm">/* coeffs are s_j; output sequence as N-1 degree polynomial) */</span>

<span class="cm">/* connection polynomial */</span>

<span class="n">polynomial</span><span class="p">(</span><span class="n">field</span><span class="w"> </span><span class="n">K</span><span class="p">)</span><span class="w"> </span><span class="n">C</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="cm">/* coeffs are c_j */</span>