{"id":"W2020692437","doi":"10.1016/s0012-365x(02)00622-2","title":"Optimal linear rate 12 codes over F5 and F7","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Separable space; Discrete mathematics; Linear code; Minimum distance; Block code; Algorithm; Decoding methods; Mathematical analysis","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.002387942,0.001486123,0.001271882,0.001440987,0.00167964,0.002863264,0.001408377,0.002111854,0.01146014],"category_scores_gemma":[0.007501825,0.0006081379,0.0007872423,0.001709518,0.001819139,0.002639298,0.002824153,0.001890966,0.002413203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002933705,"about_ca_system_score_gemma":0.003568637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002125086,"about_ca_topic_score_gemma":0.002829529,"domain_scores_codex":[0.9965234,0.001020239,0.0001785567,0.0003306387,0.0008601692,0.001086938],"domain_scores_gemma":[0.9950955,0.002718849,0.0005376639,0.0007326506,0.0006196422,0.0002957032],"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.002298948,0.0001837044,0.001079648,0.0003350307,0.00009485784,0.0002445083,0.0004631119,0.04734377,0.009665613,0.7856429,0.01653812,0.1361098],"study_design_scores_gemma":[0.0004725156,0.0005004848,0.0009084863,0.000349744,0.0001348537,0.0005185626,0.0003483333,0.1369913,0.02095214,0.8147846,0.02386539,0.0001736388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4454041,0.006641141,0.3826894,0.00834157,0.0008091773,0.0004368624,0.003734771,0.002142008,0.1498009],"genre_scores_gemma":[0.8731193,0.002022605,0.09776341,0.0009954815,0.0003494455,0.0003249422,0.001095645,0.0003322618,0.02399697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01146014,"threshold_uncertainty_score":0.03833795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01614580043218577,"score_gpt":0.2490812867798957,"score_spread":0.2329354863477099,"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."}}