{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658299,0.0007946918,0.0007073905,0.001691161,0.00102586,0.0007508873,0.001170645,0.0006763586,0.003155483],"category_scores_gemma":[0.002635908,0.0004087735,0.0005933515,0.001069336,0.0006061043,0.0009870421,0.001273533,0.0007839705,0.001200814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006797742,"about_ca_system_score_gemma":0.001688815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002517979,"about_ca_topic_score_gemma":0.003441605,"domain_scores_codex":[0.9995902,0.00006341922,0.00003374229,0.00007975889,0.0001782555,0.00005463336],"domain_scores_gemma":[0.9991689,0.0003419587,0.00007776177,0.000134604,0.0002443517,0.00003249445],"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.0002507564,0.0001066511,0.001641796,0.0003403447,0.00007363293,0.0003064682,0.0004462131,0.2103218,0.03299372,0.04237242,0.005113411,0.7060328],"study_design_scores_gemma":[0.0001049163,0.00008196529,0.0003606106,0.00003643679,0.00003170572,0.0003258724,0.00008862509,0.9440034,0.01622683,0.03157654,0.007120653,0.00004228299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01009543,0.00008397882,0.9875064,0.00005523914,0.00002052188,0.0001031666,0.00006797771,0.0007376715,0.001329734],"genre_scores_gemma":[0.06329488,0.00008489451,0.9342638,0.00003285064,0.00001086238,0.000201804,0.0002877861,0.000104537,0.001718524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003155483,"threshold_uncertainty_score":0.0105561,"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."}}