{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003260693,0.0003769698,0.0008498013,0.001701953,0.001898282,0.002697004,0.001317797,0.001773501,0.004397976],"category_scores_gemma":[0.02055483,0.0003659316,0.0006943148,0.001544151,0.004802124,0.01197575,0.002794686,0.002791694,0.0004689388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382525,"about_ca_system_score_gemma":0.0009522869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047172,"about_ca_topic_score_gemma":0.0005320163,"domain_scores_codex":[0.9961368,0.001223455,0.0002991665,0.0007017863,0.001038764,0.0005999712],"domain_scores_gemma":[0.97923,0.01561081,0.001517573,0.001713278,0.001330234,0.0005981529],"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.0003084332,0.0001264174,0.002334287,0.00009792658,0.00001638157,0.0002182364,0.001115734,0.006360656,0.001916287,0.9521943,0.001121386,0.03418986],"study_design_scores_gemma":[0.0000268332,0.00008176794,0.0007115411,0.00003407061,0.00001147285,0.0002504551,0.0003493295,0.01338794,0.001817314,0.9806317,0.002678102,0.00001952909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7227556,0.001719684,0.2099501,0.003812738,0.0002411718,0.0001463033,0.00039626,0.0001633427,0.06081475],"genre_scores_gemma":[0.975233,0.0009739953,0.01882625,0.0003325544,0.0004291872,0.00005604961,0.0005752346,0.0000660592,0.003507626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004397976,"threshold_uncertainty_score":0.01724434,"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."}}