{"id":"W2964312726","doi":"10.1109/istc.2010.5613902","title":"An efficient algorithm for finding dominant trapping sets of LDPC codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Decoding methods; Set (abstract data type); Code (set theory); Trapping; Error floor; Graph; Tanner graph; 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.0008117862,0.0001184261,0.0001802141,0.0001516657,0.0001155433,0.00006361512,0.0008257921,0.00007513629,0.00000669602],"category_scores_gemma":[0.0000678713,0.0001021128,0.00007574126,0.0002252911,0.00004319988,0.0001719322,0.0001040455,0.0001420387,0.000001852167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001592874,"about_ca_system_score_gemma":0.00004872078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005203122,"about_ca_topic_score_gemma":0.00004561611,"domain_scores_codex":[0.9989434,0.00002616848,0.000244916,0.0003404501,0.0001803382,0.0002647374],"domain_scores_gemma":[0.9988996,0.0002194791,0.0001199628,0.0005640314,0.0001264874,0.00007037267],"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.000004144743,0.0002033158,0.0002086376,0.00002888007,0.00001089695,0.000003418142,0.002040671,0.0001314535,0.3693579,0.01869233,0.000344355,0.608974],"study_design_scores_gemma":[0.0001171479,0.0001121367,0.0002029848,0.00001767005,0.000002847904,0.00001123993,0.00004494017,0.6207183,0.3778884,0.0006282363,0.000146889,0.0001092077],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1701432,0.000005445293,0.8282161,0.00007236061,0.0004786983,0.0002572174,0.000002945978,0.0003441262,0.0004798987],"genre_scores_gemma":[0.5108555,3.709606e-7,0.489051,0.00002501404,0.00001873865,0.00001739961,7.193859e-7,0.00000604128,0.00002524749],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6205868,"threshold_uncertainty_score":0.4164041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02046661868570795,"score_gpt":0.3120179604508443,"score_spread":0.2915513417651364,"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."}}