{"id":"W2755348373","doi":"10.46298/dmtcs.3550","title":"Hamming distance from irreducible polynomials over $\\mathbb {F}_2$","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Polynomial; Degree (music); Conjecture; Irreducible polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004397048,0.0004358453,0.0004950676,0.0003693983,0.0007863232,0.001232991,0.004309666,0.0001124733,0.0001454768],"category_scores_gemma":[0.0002174508,0.0003622591,0.0002609698,0.001954415,0.002751196,0.001111303,0.001610283,0.0003437219,0.0001129261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007813294,"about_ca_system_score_gemma":0.0001074496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008817699,"about_ca_topic_score_gemma":0.000003205346,"domain_scores_codex":[0.9953763,0.00009453575,0.0008052007,0.001262303,0.001251692,0.001209987],"domain_scores_gemma":[0.9957523,0.001227908,0.0002663147,0.002037356,0.0001643457,0.0005517563],"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.00001396037,0.0001125136,0.00007610175,0.00001820855,0.00001533165,0.00002565925,0.002439135,0.00001212787,0.003315168,0.9805519,0.00005403476,0.01336583],"study_design_scores_gemma":[0.0002900767,0.0001147917,0.0005254775,0.0001496352,0.00001846798,0.0000222569,0.0000983235,0.1705875,0.01127282,0.8159081,0.0004544397,0.0005580299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07296696,0.00008571483,0.9163907,0.0003243644,0.0009289703,0.0002450737,0.00001042487,0.0003871629,0.008660654],"genre_scores_gemma":[0.6350238,0.000003068672,0.3644579,0.0002975459,0.0001814747,0.000005513297,0.000001846379,0.00001756911,0.00001133442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5620568,"threshold_uncertainty_score":0.9999627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01240369567851942,"score_gpt":0.2623634053157415,"score_spread":0.2499597096372221,"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."}}