{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005161443,0.0001402544,0.0001685129,0.00006075504,0.0001235216,0.0001482055,0.000302555,0.00004476091,0.00004167602],"category_scores_gemma":[0.00008471318,0.000115173,0.00006728563,0.0001735284,0.00008172372,0.000208119,0.0001129262,0.00009252207,0.00002419781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005274916,"about_ca_system_score_gemma":0.00001473088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.155902e-7,"about_ca_topic_score_gemma":0.00000100442,"domain_scores_codex":[0.9991809,0.00007383704,0.0001787593,0.0002184574,0.0001337082,0.0002143184],"domain_scores_gemma":[0.9992268,0.0001719073,0.00007047652,0.000423589,0.00002286697,0.00008432681],"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.00000276697,0.00003906956,0.0001433607,0.00004946742,0.0000221672,0.000007198679,0.001882016,0.0000513655,0.0004537299,0.9967291,0.0001656348,0.0004541005],"study_design_scores_gemma":[0.0009683279,0.0002458775,0.0005260936,0.0001668243,0.00006430678,0.00009151,0.0005787705,0.158447,0.01049489,0.8134086,0.01413622,0.0008716015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2354832,0.00009388115,0.7548856,0.0001115739,0.0001064205,0.0001141301,0.00000415687,0.0001326061,0.009068422],"genre_scores_gemma":[0.5617948,0.00004519135,0.4374172,0.0002440483,0.00003372804,0.00001098093,0.000001667271,0.000018594,0.0004338103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3263116,"threshold_uncertainty_score":0.4696619,"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."}}