{"id":"W1980613467","doi":"10.1016/s0893-9659(99)00159-7","title":"New linear codes over GF(8)","year":2000,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Hamming code; Hamming distance; Minimum distance; Dimension (graph theory); Combinatorics; Linear code; Discrete mathematics; GF(2); Finite field; Block code; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001912308,0.0001591442,0.0001733718,0.00007336574,0.00009778929,0.0001079533,0.0007506145,0.00004351367,0.0005491733],"category_scores_gemma":[0.00000388326,0.0001460437,0.00008723707,0.0003116607,0.00004090758,0.0001254908,0.00007704483,0.00011929,0.0005493119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001145115,"about_ca_system_score_gemma":0.00001474034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003910683,"about_ca_topic_score_gemma":6.963747e-7,"domain_scores_codex":[0.9990273,0.000009902577,0.0002029444,0.0002639335,0.0002294325,0.0002664799],"domain_scores_gemma":[0.9990711,0.0001256781,0.00005389146,0.0006408834,0.000006427822,0.0001019689],"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.000007478269,0.00006407696,0.000005644394,0.00003121746,0.00003621752,0.000007755872,0.001725728,0.0001535347,0.01855704,0.9022744,0.02146014,0.05567673],"study_design_scores_gemma":[0.002042349,0.00009352036,0.0002089691,0.0001258233,0.00008301516,0.00005581735,0.00009216239,0.02066153,0.03068289,0.8268914,0.1174493,0.001613274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07881144,0.00001628009,0.8884873,0.001326533,0.00007834168,0.0001561184,9.930724e-7,0.0003665783,0.03075641],"genre_scores_gemma":[0.118557,0.00001286939,0.8731164,0.007442391,0.0002060394,0.00002190521,0.000002460314,0.00002893996,0.0006120239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09598913,"threshold_uncertainty_score":0.7060477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00933888417098147,"score_gpt":0.2142473338696172,"score_spread":0.2049084496986357,"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."}}