{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454672,0.0004556415,0.000719082,0.002047758,0.001633192,0.001182413,0.001123188,0.0005600615,0.003024854],"category_scores_gemma":[0.01517724,0.0002756371,0.0004769719,0.002251239,0.001563331,0.002661778,0.001253217,0.001048323,0.0004254595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001532656,"about_ca_system_score_gemma":0.0009439146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001719378,"about_ca_topic_score_gemma":0.00145882,"domain_scores_codex":[0.9983295,0.000305517,0.00007637109,0.000384569,0.0004959059,0.0004081242],"domain_scores_gemma":[0.9841232,0.009949015,0.002587948,0.001968106,0.0008094584,0.0005621834],"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.00154231,0.0002779144,0.054331,0.0004963906,0.0001946481,0.0007075755,0.001297657,0.09934919,0.02761901,0.6588289,0.005639161,0.1497163],"study_design_scores_gemma":[0.0001249808,0.0008062097,0.02450875,0.0001129016,0.0001328764,0.002291033,0.0004479146,0.315434,0.03171683,0.6095379,0.01471108,0.0001754994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.928971,0.0003433295,0.06397367,0.0003981384,0.00002615851,0.00003389035,0.0008963664,0.0002149319,0.005142597],"genre_scores_gemma":[0.9875556,0.0002525582,0.01015749,0.0000688694,0.00004007512,0.00003823149,0.0007410848,0.00003825388,0.00110792],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003024854,"threshold_uncertainty_score":0.01112026,"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."}}