{"id":"W2125332127","doi":"10.1109/tcomm.2004.838730","title":"Graph-Based Message-Passing Schedules for Decoding LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Decoding methods; Factor graph; Belief propagation; Additive white Gaussian noise; Algorithm; Message passing; Mathematics; Probabilistic logic; Computer science; Bipartite graph; Graph; Channel (broadcasting); Discrete mathematics; Parallel computing; Statistics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004327346,0.0002035046,0.000196922,0.0004061142,0.001419132,0.0002154184,0.00234169,0.0001075688,0.000004521024],"category_scores_gemma":[0.00003262555,0.0002246866,0.0002186465,0.0007450791,0.0001792973,0.0004748477,0.00001298583,0.0004484474,0.00001612469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002013085,"about_ca_system_score_gemma":0.0002355085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001075611,"about_ca_topic_score_gemma":0.0006270816,"domain_scores_codex":[0.9986681,0.0001257644,0.0003422269,0.0003572187,0.0002008875,0.0003057727],"domain_scores_gemma":[0.9960435,0.0008301006,0.0001343998,0.0026968,0.0002002127,0.00009500106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007240564,0.003599188,0.00009902444,0.0001469137,0.0002824084,0.000004857161,0.002907066,0.1405745,0.03363864,0.5557764,0.0003502471,0.2625483],"study_design_scores_gemma":[0.002129749,0.0004695801,0.0001368168,0.0007119122,0.0001385185,0.00002650437,0.0002312157,0.3101338,0.5463021,0.1352693,0.003293332,0.001157113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001350841,0.0001230689,0.9896041,0.006053506,0.0003013531,0.0004517878,0.00002040414,0.001457415,0.0006375367],"genre_scores_gemma":[0.5249537,0.00004344017,0.4744775,0.000208828,0.000006502969,0.0002715039,0.000003034533,0.00001682254,0.0000186546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5236028,"threshold_uncertainty_score":0.9998809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05850431123779526,"score_gpt":0.3256316168387922,"score_spread":0.267127305600997,"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."}}