Content deleted Content added
→The algorithm for the binary field: drop typical; GF2 is clear |
→The algorithm for the binary field: + discrepancy |
||
Line 145:
#[[Assignment (computer science)|assign]] <math>L \leftarrow 0, m \leftarrow -1</math>.
#'''For''' <math>N = 0</math> '''step''' 1 '''while''' <math>N < n </math>:<!-- should be N <= n ??? -->
#*Let discrepancy <math>d</math> be <math>s_N + c_1s_{N-1} + c_2s_{N-2} + \cdots + c_Ls_{N-L}</math>.<!-- These are operations in the FIELD -->
#*'''if''' <math>d = 0</math>, '''then''' <math>c</math> is already a polynomial which annihilates the portion of the stream from <math>N-L</math> to <math>N</math>.
#*'''else''':
| |||