Decoding of binary separable Goppa codes usingBerlekamp-Massey algorithm
Michele Elia, Emanuele Viterbo, G. Bertinetti · Electronics Letters · 1999
It is shown that the Berlekamp-Massey algorithm can be applied without exceptions to decode the class of binary Goppa codes with location set Γ = {γ1, ..., γn} ⊆ GF(2m) and separable Goppa polynomial G(z) = zt + z + β defined over GF(2m) such that G(γi) ≠ 0 for 1 ≤ i ≤ n, up to tile designed minimum distance 2t + 1.