{"id":"W2152724910","doi":"10.1016/j.jsc.2010.06.021","title":"On the De Boer–Pellikaan method for computing minimum distance","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Connection (principal bundle); Ideal (ethics); Code (set theory); Projective test; Minimum distance; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Geometry; Law; Computer science; Programming language","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.002108347,0.0001033996,0.000166206,0.0001388944,0.0002275763,0.0001681415,0.0006343459,0.00004517448,0.000004385831],"category_scores_gemma":[0.0002007303,0.00007281495,0.0001793355,0.0003059669,0.00003697823,0.0001651962,0.00004442277,0.0003258294,0.000002561744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061355,"about_ca_system_score_gemma":0.00006188465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001388623,"about_ca_topic_score_gemma":0.000002659174,"domain_scores_codex":[0.9989519,0.0001554714,0.0003384329,0.0001366261,0.0002245879,0.0001930526],"domain_scores_gemma":[0.9971783,0.001943137,0.0004094824,0.0001836882,0.0002099439,0.00007542814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005167789,0.0000880208,0.0001245698,0.0000136887,0.00003705621,0.000004410465,0.002489174,0.007255419,0.004029102,0.814887,0.001089312,0.1699305],"study_design_scores_gemma":[0.0003525237,0.0002155555,0.001707968,0.00004066925,0.00001420699,0.00009537649,0.0000826227,0.5935428,0.00105254,0.4014671,0.001327776,0.0001009111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1544068,0.00002491814,0.8425112,0.001956746,0.0006866947,0.0001013004,5.825163e-7,0.00002373098,0.0002879483],"genre_scores_gemma":[0.7757107,0.000001420383,0.2235655,0.0004645289,0.000242843,0.000001374353,2.907596e-7,0.000006093473,0.000007278765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6213039,"threshold_uncertainty_score":0.2969308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01318206969507329,"score_gpt":0.2990532433500757,"score_spread":0.2858711736550024,"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."}}