A generated Polynomial g(z) is called separable when the polynomial has no roots of
multiplicity greater than one (i.e. has no repeated roots). In this case the minimum distance
of the Goppa code will be the larger d ≥ 2t + 1 and can be correct t errors.
Obviously, according (1) and (2) in irreducible Goppa code, none of α’s yields the condition