{"id":"W3132925507","doi":"10.1109/tcomm.2021.3078776","title":"Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Sequential decoding; Computer science; Schedule; List decoding; Scheduling (production processes); Tanner graph; Algorithm; Berlekamp–Welch algorithm; Node (physics); Theoretical computer science; Concatenated error correction code; Block code; Mathematical optimization; 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.0002985921,0.0001641608,0.0002132245,0.0002680956,0.0005750739,0.00009434707,0.001449439,0.00008521998,0.00002255021],"category_scores_gemma":[0.00003140039,0.0001688997,0.00007675491,0.001592099,0.0001309547,0.0004522036,0.00002735159,0.0004071099,0.00001548709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001439465,"about_ca_system_score_gemma":0.0002928271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008925661,"about_ca_topic_score_gemma":0.0004551084,"domain_scores_codex":[0.9985792,0.000243113,0.0003609416,0.000328311,0.0002691233,0.0002192942],"domain_scores_gemma":[0.995959,0.0005386568,0.0001845497,0.002772216,0.0004804964,0.00006502592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001225533,0.008093519,0.001346756,0.0004537907,0.0009188981,0.0000279418,0.006100202,0.125722,0.2170247,0.3354082,0.0002577108,0.3045237],"study_design_scores_gemma":[0.0006365866,0.0002106498,0.0004123653,0.0005299335,0.0001224617,0.00009887091,0.0003306039,0.7085892,0.2828262,0.005081852,0.0006313874,0.0005298126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004564197,0.0002446224,0.9911925,0.001183716,0.0001535441,0.000200364,0.00001766623,0.0005028848,0.001940546],"genre_scores_gemma":[0.5790243,0.0002711125,0.4204761,0.00005758248,0.000002463265,0.00005578674,0.000006539133,0.00001317121,0.00009295798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5828672,"threshold_uncertainty_score":0.688753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02249377567491044,"score_gpt":0.2773086934669027,"score_spread":0.2548149177919923,"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."}}