{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806437,0.0001393079,0.0001555362,0.0003501411,0.0001775735,0.0000567548,0.000264042,0.00007489206,0.00002480737],"category_scores_gemma":[0.000008452703,0.0001155648,0.00005279075,0.0002883083,0.00005584518,0.001225288,0.000005562713,0.00008959042,0.000005436888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008314549,"about_ca_system_score_gemma":0.00009920252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001579989,"about_ca_topic_score_gemma":7.973283e-7,"domain_scores_codex":[0.9989292,0.00007405873,0.0003862196,0.0001713613,0.0002420606,0.0001971263],"domain_scores_gemma":[0.9990011,0.0002872388,0.0001664583,0.0002723983,0.0002019451,0.00007083476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004898842,0.00003507805,0.000002342505,0.00004337139,0.00003156325,9.445194e-8,0.002332741,0.0008878891,0.01229175,0.009204837,0.00002277345,0.9750986],"study_design_scores_gemma":[0.001378563,0.0004102706,0.0002091004,0.0003629011,0.00003793874,0.00001711435,0.0005335695,0.2466695,0.7459349,0.003676256,0.0004292704,0.0003405467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007767884,0.00000458061,0.9907961,0.0001511973,0.0003121002,0.0005667228,0.0001034163,0.0002276935,0.00007025857],"genre_scores_gemma":[0.7268658,0.00002825233,0.2725359,0.0002038625,0.00002519635,0.0001151712,0.00001905962,0.00001481877,0.0001919243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.974758,"threshold_uncertainty_score":0.4712595,"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."}}