{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959325,0.001069602,0.0008843649,0.002155878,0.001092916,0.0009883948,0.001432063,0.000901668,0.004907652],"category_scores_gemma":[0.003566049,0.0005065604,0.0006906741,0.001352509,0.0007268812,0.001254137,0.00164515,0.0010517,0.001834767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009759659,"about_ca_system_score_gemma":0.002167155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002873562,"about_ca_topic_score_gemma":0.003714818,"domain_scores_codex":[0.9993256,0.0001285597,0.00005191893,0.0001265487,0.0002814234,0.00008594365],"domain_scores_gemma":[0.9988421,0.0005395904,0.00008461504,0.000155553,0.0003409518,0.00003727612],"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.0003117906,0.0001465644,0.001567403,0.0004057851,0.00009011197,0.0003730445,0.0004948163,0.2637545,0.02594463,0.07592497,0.007182109,0.6238043],"study_design_scores_gemma":[0.0001136963,0.00007261255,0.0002324464,0.00003960966,0.00002877701,0.0002650032,0.00007077331,0.9344227,0.01098733,0.0473795,0.006347571,0.00003987786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006162643,0.00009198643,0.990956,0.00006565051,0.00002000239,0.0001124796,0.00008467312,0.00080134,0.001705217],"genre_scores_gemma":[0.06771601,0.0001123282,0.9287754,0.00005637627,0.00001478338,0.0003353695,0.0003924333,0.0001564221,0.00244086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004907652,"threshold_uncertainty_score":0.01641768,"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."}}