{"id":"W2986162624","doi":"10.13069/jacodesmath.645015","title":"Construction of quasi-twisted codes and enumeration of defining polynomials","year":2019,"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":"Enumeration; Hamming code; Combinatorics; Mathematics; Linear code; Minimum distance; Hamming distance; Code (set theory); Finite field; Discrete mathematics; Block code; Algorithm; Computer science; Decoding methods","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.0003922578,0.0004018965,0.0004220403,0.001047342,0.0008264324,0.001151619,0.0007710841,0.000480893,0.003119917],"category_scores_gemma":[0.001817696,0.0003094002,0.0004407556,0.001050657,0.001102071,0.001444727,0.001585391,0.001005555,0.0008224961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007121185,"about_ca_system_score_gemma":0.0008878802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004045713,"about_ca_topic_score_gemma":0.0006011672,"domain_scores_codex":[0.9993958,0.0001533646,0.0000507079,0.00007828271,0.0001747601,0.0001470286],"domain_scores_gemma":[0.9989265,0.0003616945,0.000131194,0.0002427156,0.0001877988,0.0001500795],"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.0001790131,0.00007733217,0.002393513,0.0001610198,0.00001234157,0.000343504,0.0006098044,0.01417058,0.03127144,0.8896823,0.002023865,0.05907539],"study_design_scores_gemma":[0.00005258672,0.0002636183,0.001427613,0.0001133172,0.00003151496,0.001475091,0.0004116858,0.1571594,0.06747374,0.7552295,0.01624624,0.0001157302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6054457,0.0003570876,0.3647211,0.0004434188,0.0001275191,0.0001258185,0.0006215558,0.0004952968,0.02766244],"genre_scores_gemma":[0.8612135,0.0003589248,0.129023,0.0001229179,0.00004647732,0.0001343845,0.0007707909,0.0001289689,0.008200958],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003119917,"threshold_uncertainty_score":0.01043713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004648419889312304,"score_gpt":0.2245317418811273,"score_spread":0.219883321991815,"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."}}