{"id":"W2120095615","doi":"10.1109/isit.2004.1365219","title":"Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Code word; Finite field; Upper and lower bounds; Characterization (materials science); Mathematics; Discrete mathematics; Code (set theory); Physics; Decoding methods; Algorithm; Mathematical analysis; Computer science","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.0004042174,0.0001163409,0.0002268339,0.0001228851,0.00007017628,0.00002775492,0.0009233103,0.00003651412,0.00006372349],"category_scores_gemma":[0.00005281752,0.00007469653,0.0001610004,0.0005817984,0.0004490749,0.0001958485,0.000137009,0.00007905284,0.000004007447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008441866,"about_ca_system_score_gemma":0.00008244845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004607551,"about_ca_topic_score_gemma":0.000009048269,"domain_scores_codex":[0.99896,0.00007987586,0.0003050319,0.0002331079,0.0002567288,0.0001652685],"domain_scores_gemma":[0.9986756,0.0003586186,0.0001721989,0.0006793216,0.00006401107,0.00005023127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006735069,0.0003579472,0.0006169349,0.00006913075,0.00005473311,0.000001657086,0.001337294,0.0001873263,0.02779156,0.9659548,0.0007615097,0.002799693],"study_design_scores_gemma":[0.0006571799,0.000870827,0.004941796,0.0003093042,0.00002737617,0.000006315587,0.001099783,0.0005089486,0.6047966,0.3853014,0.001212893,0.0002675797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.931359,0.0004536163,0.02593903,0.001835924,0.0001523334,0.0001451865,0.00001791695,0.0000514032,0.04004559],"genre_scores_gemma":[0.9959853,0.0000421774,0.003631606,0.0001672302,0.00001534756,0.000006089794,7.685574e-7,0.000004722097,0.0001468052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5806534,"threshold_uncertainty_score":0.3046036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01417679337950016,"score_gpt":0.2358233241332501,"score_spread":0.2216465307537499,"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."}}