{"id":"W3136518070","doi":"10.1109/tcomm.2021.3065976","title":"ADMM Check Node Penalized Decoders for LDPC Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Low-density parity-check code; Code word; Algorithm; Node (physics); Mathematics; Parity-check matrix; Computer science; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.0003402972,0.0001891175,0.0002291045,0.0001722077,0.0008472563,0.0001709073,0.002267023,0.0001095491,0.00003948687],"category_scores_gemma":[0.0000586726,0.0002157654,0.000242701,0.0006828883,0.0001117669,0.0003600094,0.00002586667,0.0003960881,0.00004995871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001255548,"about_ca_system_score_gemma":0.0002754298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000593408,"about_ca_topic_score_gemma":0.0009525349,"domain_scores_codex":[0.9985123,0.000227133,0.0003577041,0.0004057481,0.0002040319,0.0002931355],"domain_scores_gemma":[0.9946546,0.001034064,0.0001108646,0.003693188,0.0004008312,0.0001064329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002529382,0.01015556,0.0001986205,0.0003714235,0.001447452,0.0000347706,0.0179216,0.01740405,0.2057753,0.2177141,0.04126219,0.487462],"study_design_scores_gemma":[0.001591742,0.000213187,0.0000957369,0.0002235009,0.0001501116,0.0001209415,0.0005037608,0.3161363,0.6088545,0.01648132,0.05464094,0.0009879327],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004277934,0.0002246847,0.9860917,0.007950528,0.0003996001,0.0003535374,0.00003844,0.001008946,0.003504795],"genre_scores_gemma":[0.5027605,0.0002762136,0.4948756,0.0006327413,0.00001052672,0.000442595,0.00001128439,0.00002344485,0.000967171],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5023327,"threshold_uncertainty_score":0.8798656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06324101790705305,"score_gpt":0.3371862364926889,"score_spread":0.2739452185856359,"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."}}