Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance

International audienceThe Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed–Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Furthermore, the failure probability is derived