“…The smallest value for s was studied by Carbonne, Henocq, Rotillon and Thiong-Ly [11,42,43]. This algorithm is not effective, that is to say the existence of these s divisors is guaranteed by a counting argument using the zeta function of the curve, but the actual construction of those was only achieved for hyperelliptic curves of genus at most 4 by Le Brigand [58,59] and the Klein curve by Henocq and Rotillon [43,81]. It looks like a difficult (possibly hopeless) problem in general, which is, moreover, obsolete from the decoding point of view, given the solutions of the decoding problem which we will discuss below.…”