Berlekamp–Massey algorithm: Difference between revisions

Revision as of 04:28, 16 October 2019

Revision as of 17:57, 11 November 2019

Line 149:

#*'''else''':

#** Let <math>t</math> be a copy of <math>c</math>.

#** Set <math>c_{n-m} \leftarrow c_{n-m} \oplus b_0, c_{n-m+1} \leftarrow c_{n-m+1} \oplus b_1, \dots </math> up to <math>c_{nN-1} \leftarrow c_{nN-1} \oplus b_{N-n+m-1}</math> (where <math>\oplus</math> is the [[Exclusive or]] operator).

#** If <math>L \le \frac{n}{2}</math>, set <math>L \leftarrow n+1-L</math>, set <math>m \leftarrow n</math>, and let <math>b \leftarrow t</math>; otherwise leave <math>L</math>, <math>m</math> and <math>b</math> alone.