{"id":"W2521520100","doi":"10.1109/tit.2016.2613113","title":"New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Huawei Technologies","keywords":"Characterization (materials science); Algorithm; Tanner graph; Mathematics; Simple (philosophy); Low-density parity-check code; Multiplicity (mathematics); Graph theory; Graph; Data structure; Combinatorics; Discrete mathematics; Decoding methods; Computer science; Error floor","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027619,0.0004569519,0.0005914408,0.001006688,0.0005184974,0.000777586,0.0008289104,0.0005126003,0.00222883],"category_scores_gemma":[0.002130119,0.000262473,0.0005016733,0.0007494418,0.0005635343,0.00165552,0.001106491,0.0008518708,0.000396212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008152825,"about_ca_system_score_gemma":0.001287149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001588165,"about_ca_topic_score_gemma":0.001936889,"domain_scores_codex":[0.999574,0.00006653456,0.0000381017,0.000095088,0.000159064,0.00006711378],"domain_scores_gemma":[0.9991207,0.000419932,0.0001047882,0.0001354259,0.0001701085,0.0000490452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005431326,0.0002117714,0.006619269,0.0005845854,0.00009099225,0.0003902651,0.0008048178,0.3076259,0.05944544,0.238019,0.007122261,0.3785425],"study_design_scores_gemma":[0.00005134239,0.0001124215,0.0007437436,0.00003513335,0.00002139945,0.0002753014,0.00008666322,0.9233651,0.01277112,0.0580711,0.004433525,0.00003327139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109943,0.0002943521,0.8808678,0.0002342995,0.00002632248,0.0002231891,0.0003414495,0.000655407,0.006362897],"genre_scores_gemma":[0.5337,0.000264172,0.4591891,0.0001693932,0.00003299137,0.0003433472,0.001504395,0.0001467533,0.004649754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00222883,"threshold_uncertainty_score":0.007456183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01158639582930565,"score_gpt":0.2472454656678147,"score_spread":0.2356590698385091,"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."}}