{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000394655,0.0001523603,0.0001744027,0.0000894007,0.0001479194,0.0001177769,0.0007364773,0.00004809826,0.00002011603],"category_scores_gemma":[0.00004541276,0.0001265708,0.0001200529,0.0003687934,0.00008106639,0.0002709036,0.0002321005,0.0001139363,0.0001525157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001519775,"about_ca_system_score_gemma":0.00003381992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002220342,"about_ca_topic_score_gemma":7.336528e-7,"domain_scores_codex":[0.9991006,0.00003578567,0.0002133739,0.0002310366,0.0001678046,0.0002513661],"domain_scores_gemma":[0.9991082,0.00009633511,0.00008076329,0.0005907216,0.0000377944,0.00008616502],"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.000004348043,0.00009308435,0.00001101654,0.00004480012,0.00002198038,0.00002660763,0.002283975,0.001981088,0.001218328,0.9937695,0.00008240856,0.0004628611],"study_design_scores_gemma":[0.0009112642,0.0003669568,0.0001584356,0.000227401,0.00003682218,0.00006256414,0.0005074257,0.09420571,0.01497743,0.8857526,0.002125305,0.000668129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1510606,0.00004715706,0.8442456,0.0006264718,0.0001300921,0.0001088494,0.000004234999,0.0002923663,0.003484704],"genre_scores_gemma":[0.5696015,0.00001858026,0.4299339,0.0002341598,0.00005513967,0.00001227135,0.000003626504,0.00001566203,0.0001251579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.418541,"threshold_uncertainty_score":0.5161406,"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."}}