{"id":"W2732089117","doi":"10.13069/jacodesmath.327375","title":"On the equivalence of cyclic and quasi-cyclic codes over finite fields","year":2017,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Cyclic code; Huffman coding; Mathematics; Cyclic group; Combinatorics; Discrete mathematics; Equivalence (formal languages); Prime (order theory); Linear code; Block code; Algorithm; Decoding methods; Data compression","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.0002969275,0.0001146814,0.000186908,0.00008033489,0.0005775093,0.0002535182,0.0009651737,0.00005612088,0.000007379945],"category_scores_gemma":[0.0001058637,0.0000733705,0.00008905469,0.0001257436,0.0002510468,0.0002348793,0.0002289125,0.0002416951,2.26344e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005833584,"about_ca_system_score_gemma":0.00002110295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000595252,"about_ca_topic_score_gemma":0.000001546457,"domain_scores_codex":[0.9991935,0.00004847891,0.0002625844,0.0001530913,0.0002195716,0.0001227323],"domain_scores_gemma":[0.9981673,0.0005180784,0.0005440593,0.0006017166,0.00008509542,0.00008376432],"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.000009158734,0.00002381254,0.0009462793,0.00001391362,0.00002847188,9.100539e-7,0.0001618665,0.000006711536,0.000210453,0.9937739,0.00008230788,0.004742245],"study_design_scores_gemma":[0.0002392512,0.0002079041,0.02830346,0.00003318455,0.00002245703,0.00001620995,0.00003927209,0.0003619456,0.000597433,0.9695349,0.000555171,0.00008887088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8913795,0.0007439064,0.1039681,0.002433253,0.0001919714,0.0001794341,0.00001049077,0.00001252528,0.001080789],"genre_scores_gemma":[0.998973,0.0004211493,0.0004060357,0.0001332195,0.00004442435,0.000005749859,2.808933e-7,0.000004624799,0.00001157852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1075934,"threshold_uncertainty_score":0.4441793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0127679018977343,"score_gpt":0.2660729161778279,"score_spread":0.2533050142800936,"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."}}