{"id":"W2108147365","doi":"10.1109/isit.2011.6033699","title":"An efficient algorithm for finding dominant trapping sets of irregular LDPC codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Degree (music); Variable (mathematics); Trapping; Computer science; Set (abstract data type); Decoding methods; Mathematics","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.0007873203,0.000142923,0.0002205363,0.0001798493,0.0001090418,0.00003479979,0.0008996783,0.00006753991,0.000009732865],"category_scores_gemma":[0.00003306687,0.0001250935,0.00009556445,0.0002572633,0.00004834915,0.0002065055,0.0001229859,0.00007112046,0.000002204559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003303506,"about_ca_system_score_gemma":0.0000426171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009263757,"about_ca_topic_score_gemma":0.00001172514,"domain_scores_codex":[0.9987646,0.00004916945,0.0002935421,0.000392385,0.0001938511,0.0003064447],"domain_scores_gemma":[0.9989311,0.0001096209,0.0001454775,0.0006094885,0.0001292286,0.00007511499],"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.00001959241,0.0006639549,0.0004353705,0.00008934883,0.00004755882,0.00001684246,0.01598503,0.0001587647,0.06029792,0.04158418,0.0005528393,0.8801486],"study_design_scores_gemma":[0.0001507844,0.0002401743,0.0004089599,0.00004532816,0.000006240927,0.00001192662,0.0001376229,0.5806984,0.4166652,0.001431027,0.00005277387,0.0001515529],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05674163,0.00002636234,0.9412149,0.00002217929,0.0002592636,0.0003414421,0.000002961522,0.0004151748,0.0009760908],"genre_scores_gemma":[0.4871109,8.898151e-7,0.512798,0.0000217442,0.00000956046,0.00002193299,6.998292e-7,0.00000775734,0.00002856605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8799971,"threshold_uncertainty_score":0.5101164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04725109762105201,"score_gpt":0.2983019714345189,"score_spread":0.2510508738134669,"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."}}