{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736087,0.0005040935,0.000772727,0.001885004,0.002112897,0.004097726,0.001187565,0.001862027,0.009686327],"category_scores_gemma":[0.01027677,0.0004290949,0.0007172627,0.002118143,0.005551344,0.008161018,0.003862918,0.004554753,0.0009778379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001779409,"about_ca_system_score_gemma":0.001084411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00162502,"about_ca_topic_score_gemma":0.001046887,"domain_scores_codex":[0.9979796,0.000567414,0.00009349826,0.0003496442,0.0005941301,0.0004157553],"domain_scores_gemma":[0.9920664,0.005389364,0.0005149027,0.0008147617,0.0008549482,0.0003596235],"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.00005188934,0.00001742614,0.0001189118,0.00001216578,0.000002166105,0.00004068675,0.0001739668,0.0004741869,0.0001920687,0.9941272,0.0007186506,0.004070762],"study_design_scores_gemma":[0.00001361262,0.00001448913,0.0001467898,0.00001228838,0.000003049262,0.00003883877,0.00005518866,0.001500557,0.0001930246,0.9959801,0.002035425,0.000006500528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4107838,0.004525083,0.09783347,0.009191528,0.001183634,0.00009831232,0.0007118162,0.0002346889,0.4754378],"genre_scores_gemma":[0.9631882,0.001984545,0.008324686,0.001515503,0.001141884,0.00008043509,0.0005720624,0.0001237805,0.0230689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009686327,"threshold_uncertainty_score":0.03240395,"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."}}