proposition: Lemma td : RS.errors_ub t d.+1.
proof: Proof. by rewrite /RS.errors_ub /t half_leq. Qed.
imports: mathcomp(all_ssreflect ssralg finalg poly polydiv cyclic) mathcomp(perm matrix mxpoly vector mxalgebra zmodp) ssr_ext ssralg_ext poly_ext channel_code decoding linearcode hamming dft poly_decoding euclid grs cyclic_code