{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980646,0.0001126598,0.0001652582,0.0003883779,0.0005422888,0.00005116129,0.001798737,0.00006009803,0.00004231655],"category_scores_gemma":[0.000009576409,0.0001190961,0.0001517244,0.0009401597,0.0003438195,0.000181928,0.00002066159,0.000258662,0.00002049564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004084392,"about_ca_system_score_gemma":0.0001159323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000036551,"about_ca_topic_score_gemma":0.00007570709,"domain_scores_codex":[0.9990672,0.0001689909,0.0003045576,0.0001940194,0.0001208178,0.0001444406],"domain_scores_gemma":[0.996873,0.0006322687,0.00008094622,0.002248802,0.0001185873,0.00004643709],"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.00001264356,0.000451493,0.00003522983,0.00001520854,0.000107748,5.037681e-7,0.0004816515,0.001139661,0.002643339,0.9477301,0.0004695037,0.04691295],"study_design_scores_gemma":[0.004288696,0.0006131391,0.001545365,0.001808681,0.000554459,0.00005393025,0.001029686,0.3109258,0.2323553,0.2926961,0.1523272,0.001801668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001233576,0.0002166592,0.9760909,0.002593582,0.0003763618,0.000156485,0.00001914087,0.000214365,0.01909895],"genre_scores_gemma":[0.9499385,0.0002646843,0.04909475,0.0003016284,0.000002891086,0.0000555805,0.000001733709,0.000004514319,0.000335732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9487049,"threshold_uncertainty_score":0.4856599,"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."}}