fact: Fixpoint tn_tree_eq_bool k (a b : tn_tree i k U V) : bool := (node_id a == node_id b) && (node_tag a == node_tag b) && (up a == up b) && (down a == down b) && (length (children a) == length (children b)) && let eqch := map (@tn_tree_eq_bool (negk k)) (children a) in all (fun p => fst p (snd p)) (zip eqch (children b)).
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