{"id":"W4406949003","doi":"10.1109/tcomm.2025.3535882","title":"Constituent Automorphism Decoding of Reed-Muller Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reed–Muller code; List decoding; Computer science; Mathematics; Concatenated error correction code; Telecommunications; Block code","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007629254,0.0006022921,0.0007059446,0.0006026188,0.0006078056,0.001301027,0.000673815,0.0007857572,0.002149614],"category_scores_gemma":[0.003505199,0.0002548025,0.0005226454,0.0006375499,0.000855822,0.001398068,0.001832205,0.001357674,0.001852007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005434987,"about_ca_system_score_gemma":0.0008075221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004042801,"about_ca_topic_score_gemma":0.0006493293,"domain_scores_codex":[0.9990121,0.0003190433,0.0000537188,0.0001568921,0.0003251445,0.000133054],"domain_scores_gemma":[0.9986816,0.0004876181,0.0001313493,0.0003434122,0.0002824947,0.00007355673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009225063,0.0001245043,0.001993611,0.0001875642,0.00009345762,0.0004869234,0.0007672882,0.1721005,0.1558415,0.4569372,0.003741981,0.2068029],"study_design_scores_gemma":[0.00002534442,0.0001856018,0.0003997794,0.00003765325,0.00002795112,0.0002347449,0.00006402016,0.7187858,0.1284676,0.1444966,0.007220904,0.00005409714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1367917,0.0002722882,0.845117,0.0002860161,0.0001933249,0.00008162557,0.0001892863,0.001880291,0.0151885],"genre_scores_gemma":[0.8245443,0.0003646691,0.161601,0.0001402937,0.0001280782,0.00007062782,0.0004391645,0.000467483,0.01224427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002149614,"threshold_uncertainty_score":0.007191181,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02630969969783094,"score_gpt":0.2870004848657971,"score_spread":0.2606907851679662,"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."}}