proposition: Lemma node_id_sumprod_up {k} (t : tn_tree id' k unit unit) : node_id (sumprod_up t) = node_id t.
proof: Proof. by destruct t. Qed.
imports: Wf_nat Init.Wf Recdef Reals mathcomp(all_ssreflect perm zmodp matrix ssralg) mathcomp(Rstruct) ssrR Reals_ext ssr_ext ssralg_ext bigop_ext f2 fdist channel pproba linearcode subgraph_partition tanner tanner_partition summary ldpc checksum ldpc_algo