{"id":"W2008209264","doi":"10.1109/tit.2012.2205663","title":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Tanner graph; Decoding methods; Computer science; Degree (music); Code (set theory); Graph; Set (abstract data type); Factor graph; Belief propagation; Error floor; Mathematics; Theoretical computer science","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.001356799,0.0001331474,0.0001592313,0.0003889347,0.0002294752,0.00004325261,0.0003330924,0.00007841006,0.00001131016],"category_scores_gemma":[0.00002065721,0.0001257057,0.0001286447,0.000313176,0.00004414712,0.0009297507,0.00000307585,0.0001387407,0.00002199422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008215004,"about_ca_system_score_gemma":0.0000393111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004619081,"about_ca_topic_score_gemma":5.001916e-7,"domain_scores_codex":[0.9989141,0.00007200082,0.0004175959,0.00009854449,0.0002209549,0.0002768342],"domain_scores_gemma":[0.9988031,0.0004658248,0.0002237124,0.0003153601,0.0001257467,0.00006626434],"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.00003204385,0.0001509839,0.000002573501,0.00007346152,0.00003372937,9.24413e-8,0.01239035,0.01241422,0.001074497,0.01639289,0.00009670442,0.9573385],"study_design_scores_gemma":[0.0004545592,0.0001456946,0.00004350014,0.0001165162,0.00002342236,0.00002038434,0.0007151364,0.5645738,0.4316196,0.001555006,0.0004867137,0.0002457339],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005831008,0.00001606889,0.9917361,0.00003573298,0.001020159,0.0004182025,0.00002902627,0.0002694865,0.0006442311],"genre_scores_gemma":[0.8571782,0.000003680587,0.1425661,0.00009301413,0.00001460758,0.0001065575,0.000001933239,0.000006882285,0.00002909387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9570927,"threshold_uncertainty_score":0.5126131,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.018091293421844,"score_gpt":0.2731903225689815,"score_spread":0.2550990291471375,"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."}}