{"id":"W4402475164","doi":"10.1109/tcomm.2024.3459851","title":"Reduced-Complexity Projection-Aggregation List Decoder for Reed-Muller Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Soft-decision decoder; Reed–Muller code; Decoding methods; Projection (relational algebra); Algorithm; Theoretical computer science; Electronic engineering; Telecommunications; Block code; Concatenated error correction code; Engineering","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.0005510018,0.0002251546,0.0001904281,0.0004528862,0.001086068,0.0004358129,0.00178195,0.0001342141,0.00002591398],"category_scores_gemma":[0.00003966247,0.0002364474,0.0002231152,0.001039008,0.0001957621,0.0007773646,0.00001952468,0.0005499967,0.00007027227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002621204,"about_ca_system_score_gemma":0.0002147523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002556559,"about_ca_topic_score_gemma":0.001201421,"domain_scores_codex":[0.9983487,0.0001890253,0.0004203253,0.0005242653,0.0002360983,0.0002815647],"domain_scores_gemma":[0.9959854,0.0009619484,0.00008822724,0.002594426,0.0002869951,0.00008292557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007596643,0.001773753,0.00002594693,0.000288158,0.0004172636,0.000004059412,0.008159273,0.001556897,0.01715262,0.2822954,0.01999604,0.6682546],"study_design_scores_gemma":[0.0002981427,0.000293537,0.00006818966,0.0004039144,0.00009190755,0.00008024676,0.0001336533,0.8320456,0.07050015,0.04326902,0.05218341,0.000632217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000683832,0.0002812749,0.9831151,0.007602942,0.001207359,0.000878146,0.00005345641,0.002855056,0.003322878],"genre_scores_gemma":[0.6977246,0.0001770456,0.2997588,0.0001523335,0.000043234,0.0009290501,0.00001401243,0.00003407343,0.001166911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8304887,"threshold_uncertainty_score":0.9642043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1000569589430676,"score_gpt":0.3602639698653843,"score_spread":0.2602070109223167,"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."}}