Table 1 Description of the steps of the GC-2 algorithm

Get the sequence y from the sequence r. Do i=0. Select a test pattern b _i

Obtain the sequence y ⁱ= y ⊕ b _i

Compute the syndrome associated with the sequence y ⁱ(binary decoding)

and search the corresponding error pattern z

If z is found, then get the pattern z ⁱ= z ⊕ b _i , compute its analog weight

W _α , store the pattern ${\mathbf{z}}^{i^{\star }}$ that has the minimum analog weight, and go to the

Step 5. Otherwise, go to Step 5

If there is still test patterns to generate, do i = i + 1, select b _i , and go to

Step 2. Otherwise, go to Step 6

If a pattern ${\mathbf{z}}^{i^{\star }}$ was stored, obtain the estimate $\hat{\mathbf{x}}=\mathbf{y}\oplus {\mathbf{z}}^{i^{\star }}$. Otherwise, $\hat{\mathbf{x}}=\mathbf{y}$