{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412183,0.0007933071,0.0005193739,0.0009020928,0.000472977,0.00064442,0.0008698746,0.0005100666,0.0009176894],"category_scores_gemma":[0.007608552,0.0003072582,0.000472004,0.001007266,0.0008591671,0.0007947853,0.0004773365,0.0006635313,0.0003389062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001198079,"about_ca_system_score_gemma":0.001268485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00232349,"about_ca_topic_score_gemma":0.002601002,"domain_scores_codex":[0.9992486,0.0003338069,0.00004561387,0.00008054065,0.00022554,0.00006589535],"domain_scores_gemma":[0.9963194,0.00235757,0.000433589,0.0003766162,0.0004168155,0.00009600515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001552717,0.00003658091,0.0004947459,0.0000994431,0.00002490847,0.00006119521,0.0001483481,0.8638985,0.004462978,0.08746345,0.0007819154,0.04237271],"study_design_scores_gemma":[0.00003369607,0.000111591,0.00008914153,0.00001371909,0.00001306769,0.00002954052,0.00001482349,0.9602003,0.003402391,0.0348312,0.001248689,0.00001194703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03074946,0.0001792674,0.9669628,0.00007758589,0.00002636607,0.00009859214,0.00007007729,0.0003447471,0.00149118],"genre_scores_gemma":[0.6121942,0.0005998246,0.3842304,0.00007534195,0.00006287508,0.0004111784,0.0002885618,0.0001506492,0.00198688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00232349,"threshold_uncertainty_score":0.008692741,"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."}}