{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073876,0.0005028563,0.0003556916,0.0006312106,0.000328583,0.0004915595,0.0008639045,0.0004592972,0.0007009449],"category_scores_gemma":[0.00456545,0.0002473949,0.0002774786,0.001099929,0.0006336998,0.0008466609,0.0007083623,0.0007453436,0.0001765107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008751971,"about_ca_system_score_gemma":0.001483047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005758988,"about_ca_topic_score_gemma":0.006516693,"domain_scores_codex":[0.9995601,0.000119175,0.00002603457,0.00005987001,0.0001773822,0.00005744677],"domain_scores_gemma":[0.998202,0.001020939,0.0001876107,0.000172511,0.0003636838,0.000053236],"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.000154143,0.00003021457,0.0007828108,0.0000797259,0.00002403285,0.00007369932,0.0001055584,0.8648573,0.009263792,0.04179738,0.0008609396,0.08197044],"study_design_scores_gemma":[0.00001317128,0.00003630673,0.00009120688,0.000004489621,0.000005779331,0.00002042674,0.000007196033,0.9897801,0.003815041,0.005790451,0.0004290225,0.000006878589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04287226,0.0002093704,0.9545184,0.0001323532,0.00002185138,0.00003890603,0.00007758098,0.0002181023,0.001911196],"genre_scores_gemma":[0.6784198,0.000325666,0.3180689,0.00006660139,0.00002084027,0.00009746323,0.0002016135,0.00004511592,0.002753963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005758988,"threshold_uncertainty_score":0.01145095,"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."}}