{"id":"W2160893622","doi":"10.1016/j.disc.2003.10.027","title":"Binary optimal linear rate 1/2 codes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Automorphism group; Linear code; Minimum distance; Discrete mathematics; Binary number; Code (set theory); Binary code; Automorphism; Block code; Decoding methods; Algorithm; Arithmetic","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.001802067,0.001452868,0.001210159,0.001683158,0.001193851,0.003021224,0.001351362,0.002409006,0.01254993],"category_scores_gemma":[0.008878532,0.0008229825,0.0005988134,0.00242272,0.001626374,0.003376228,0.003027367,0.002339877,0.003118904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002214765,"about_ca_system_score_gemma":0.002580459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007322304,"about_ca_topic_score_gemma":0.0009639637,"domain_scores_codex":[0.9968787,0.0009545082,0.0001745638,0.0003482743,0.0009958011,0.000648075],"domain_scores_gemma":[0.99647,0.001705759,0.0003774661,0.0006759236,0.0005821668,0.0001886882],"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.0006433995,0.00009407382,0.0003837504,0.0002817996,0.00003932771,0.0001059823,0.0001561341,0.03235385,0.008023974,0.8641366,0.0142158,0.07956535],"study_design_scores_gemma":[0.00021058,0.0001411953,0.0003207888,0.0002127656,0.00005130648,0.0003316781,0.00008111414,0.1278618,0.01011933,0.8437434,0.01683193,0.00009404453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1067293,0.007798485,0.6781448,0.01130361,0.002203037,0.0003461786,0.002495935,0.001810108,0.1891685],"genre_scores_gemma":[0.7708863,0.004582314,0.151077,0.002766167,0.0014745,0.0007041925,0.0009878952,0.0006831604,0.0668386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254993,"threshold_uncertainty_score":0.04198372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0172842743326457,"score_gpt":0.255960872085661,"score_spread":0.2386765977530153,"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."}}