{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846485,0.001058401,0.0008321905,0.001953552,0.001134516,0.0009237402,0.001360747,0.0009145466,0.004196017],"category_scores_gemma":[0.003347314,0.0005068417,0.0007113357,0.001342761,0.0007578474,0.001344045,0.001522112,0.001101637,0.001710043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008547116,"about_ca_system_score_gemma":0.001912955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002528672,"about_ca_topic_score_gemma":0.003190565,"domain_scores_codex":[0.9994146,0.0001089297,0.00004495311,0.0001154691,0.000244384,0.0000717874],"domain_scores_gemma":[0.9989668,0.0005046934,0.00007618968,0.0001415119,0.0002762042,0.0000346374],"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.0002558894,0.0001308509,0.00117685,0.0003757661,0.00008327248,0.0003146295,0.0004346802,0.196796,0.02789279,0.06736656,0.006538449,0.6986341],"study_design_scores_gemma":[0.0001315005,0.0000932742,0.0002784613,0.00004891278,0.0000363971,0.0003806468,0.00007887134,0.9141476,0.0159772,0.05926395,0.009508731,0.00005439225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005517551,0.00009637004,0.9919373,0.0000609838,0.00002203442,0.0001030726,0.00006381041,0.0007229357,0.001475983],"genre_scores_gemma":[0.04936711,0.000113767,0.9476346,0.00004950844,0.00001491565,0.0002713849,0.0002950278,0.0001439924,0.002109697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004196017,"threshold_uncertainty_score":0.01403707,"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."}}