{"id":"W4376111567","doi":"10.1016/j.disc.2023.113489","title":"On the equivalence of linear cyclic and constacyclic codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Discrete mathematics; Equivalence (formal languages); Finite field; Combinatorics; Equivalence relation; Equivalence class (music); Permutation (music); Linear code; Block code; Algorithm","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.0005283081,0.000093034,0.0001377141,0.00007903053,0.0001268972,0.00004647088,0.0005216246,0.00002581472,0.00001117411],"category_scores_gemma":[0.0001842887,0.00005821832,0.00005947905,0.0004774408,0.0001938707,0.00007082982,0.0002297387,0.00007807085,0.00004021756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002432096,"about_ca_system_score_gemma":0.000008965194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001156543,"about_ca_topic_score_gemma":5.373015e-7,"domain_scores_codex":[0.9992793,0.00005144097,0.0001751322,0.0001494566,0.0001895423,0.0001551396],"domain_scores_gemma":[0.9981968,0.001152886,0.00008789706,0.0005045976,0.00002167409,0.00003615915],"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.000001750352,0.00001568813,0.00005720878,0.0000513171,0.00001218366,0.000001973702,0.001794021,0.000008839636,0.0008742394,0.9961124,0.0002173807,0.0008529709],"study_design_scores_gemma":[0.0001158436,0.00009385098,0.00024568,0.0001612549,0.00001136707,0.000006223105,0.0005191193,0.04358035,0.005152196,0.949791,0.0001931105,0.0001300133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8546418,0.00004337008,0.1376022,0.001387849,0.00008402516,0.0001802557,0.00001100221,0.0002101222,0.005839405],"genre_scores_gemma":[0.9933859,0.00006056463,0.006322179,0.0001391264,0.00001052224,0.000009436507,8.381689e-7,0.000006748051,0.00006475444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.138744,"threshold_uncertainty_score":0.2374074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03003914856210125,"score_gpt":0.2742312853251732,"score_spread":0.244192136763072,"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."}}