{"id":"W4319302639","doi":"10.1109/tit.2023.3242612","title":"Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Reed–Solomon error correction; Mathematics; Finite field; Reed–Muller code; Factorial; Linear code; Simple (philosophy); Distribution (mathematics); Discrete mathematics; Error detection and correction; Function (biology); Combinatorics; Decoding methods; Block code; Algorithm; Mathematical analysis","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.001050002,0.0001033225,0.0001075633,0.0001400767,0.0004758847,0.00009644419,0.0004768356,0.00005747362,0.000008828175],"category_scores_gemma":[0.0000263351,0.00008168405,0.0001642783,0.0007775861,0.0001322523,0.00101485,0.000003319288,0.0001153951,0.0000247058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002947344,"about_ca_system_score_gemma":0.00003430151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004598488,"about_ca_topic_score_gemma":0.000005888401,"domain_scores_codex":[0.9991611,0.00006861324,0.0003152348,0.0001079014,0.0001617283,0.0001853684],"domain_scores_gemma":[0.9985278,0.0007251315,0.0001524114,0.0004339067,0.0001264562,0.00003427392],"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.0003578688,0.00005313813,0.000002440263,0.00007169642,0.00006961509,1.032665e-7,0.00282453,0.008609697,0.0004394732,0.7610133,0.0004328888,0.2261252],"study_design_scores_gemma":[0.001865721,0.0008030888,0.0008382193,0.0001184037,0.0001099431,0.000008986472,0.00270043,0.6558831,0.06719158,0.2491908,0.02069299,0.0005967375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003148452,0.00001250718,0.9947618,0.0003281687,0.0007002292,0.0003444188,0.0002208849,0.0002712121,0.0002123344],"genre_scores_gemma":[0.9989911,0.00002388421,0.000523866,0.0001273934,0.00001384429,0.000178308,0.00002923782,0.000004527622,0.0001078883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9958426,"threshold_uncertainty_score":0.3660169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01373873510857665,"score_gpt":0.245341328404443,"score_spread":0.2316025932958664,"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."}}