proposition: Lemma SP_BEC0_is_iter : exists k, SP_BEC0 = iSP_BEC0 k.
proof: Proof. by rewrite /SP_BEC0; case: SP_BEC0_rec => H' [? []]. Qed.
imports: mathcomp(all_ssreflect ssralg fingroup finalg perm zmodp) mathcomp(matrix) ssr_ext ssralg_ext num_occ f2 ssrR hamming tanner linearcode