{"id":"W2008314255","doi":"10.1109/istc.2014.6955086","title":"On characterization of elementary trapping sets of variable-regular LDPC codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Variable (mathematics); Node (physics); Set (abstract data type); Graph; Characterization (materials science); Code (set theory); Class (philosophy); Simple (philosophy); Tanner graph; Discrete mathematics; Decoding methods; Combinatorics; Parallel computing; Theoretical computer science; Mathematics; Algorithm; Error floor; Statistics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966188,0.00008627464,0.0001652247,0.0001241862,0.00002855152,0.00001304025,0.0004404613,0.00003946197,0.00002638023],"category_scores_gemma":[0.0000459004,0.00008041357,0.00003325715,0.0002609717,0.00002260115,0.0002033335,0.0000912445,0.00005447806,0.000001835039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001581347,"about_ca_system_score_gemma":0.00001989779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005562183,"about_ca_topic_score_gemma":0.000003216143,"domain_scores_codex":[0.9991231,0.00008053517,0.0002711992,0.0001990795,0.0002056179,0.0001204564],"domain_scores_gemma":[0.9991719,0.0001070141,0.0001835523,0.0004286594,0.00008400037,0.00002484067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000006310973,0.00008373915,0.0008773423,0.00005128624,0.00001428353,2.449548e-7,0.0003156766,0.00003916736,0.8177627,0.1571988,0.000159106,0.02349128],"study_design_scores_gemma":[0.0001580711,0.0002925679,0.003930226,0.0001340548,0.00000624102,0.00000217832,0.00001020129,0.08335397,0.9027504,0.008991014,0.0002397173,0.0001312957],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2882074,0.000001236917,0.7090924,0.000092906,0.00009183888,0.00009172813,0.000001586397,0.00017024,0.002250661],"genre_scores_gemma":[0.8857026,0.000001851648,0.1139876,0.0002261852,0.00001072755,0.000004999733,0.000007489938,0.000006036834,0.00005255344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5974952,"threshold_uncertainty_score":0.327917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009991899201599373,"score_gpt":0.2346776725605677,"score_spread":0.2246857733589684,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}