{"id":"W2006968455","doi":"10.1023/b:desi.0000012442.78414.e4","title":"On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Minimum distance; Mathematics; Combinatorics; Linear code; Discrete mathematics; 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.0003402658,0.0002930756,0.0003438845,0.0003145418,0.0003015123,0.0002423096,0.0009146177,0.0001132005,0.0001269506],"category_scores_gemma":[0.00003101407,0.000202799,0.0002195628,0.001059675,0.0005999988,0.0002290242,0.0001367878,0.0001984164,0.000005507096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007628542,"about_ca_system_score_gemma":0.00006131915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001711421,"about_ca_topic_score_gemma":0.00002629727,"domain_scores_codex":[0.9982578,0.0002120861,0.0003435264,0.0005038207,0.00034745,0.0003353141],"domain_scores_gemma":[0.9979531,0.0009393475,0.0002141308,0.0006590525,0.0001110678,0.0001232668],"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.00007571762,0.0001045482,0.003113953,0.00001390521,0.0001189892,0.000008737345,0.0008620891,0.00001706867,0.009532866,0.9830467,0.0003333552,0.00277205],"study_design_scores_gemma":[0.001048138,0.0004318669,0.008181108,0.0001901965,0.00006071416,0.000009397247,0.0004427781,0.0007619782,0.01766179,0.970238,0.0005479903,0.0004259922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7221025,0.0006207432,0.274755,0.0004286766,0.0001550379,0.0002267401,0.00006405095,0.000122879,0.001524367],"genre_scores_gemma":[0.9835153,0.000216699,0.01580471,0.0003850917,0.00003485845,0.00002241954,0.000006678277,0.00001154076,0.000002728593],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2614128,"threshold_uncertainty_score":0.8269902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02001607963608638,"score_gpt":0.2264640588148493,"score_spread":0.2064479791787629,"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."}}