{"id":"W1504604993","doi":"10.1109/isit.1993.748411","title":"A New Remainder Based Decoding Algorithm for Reed-Solomon Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Remainder; Berlekamp–Welch algorithm; Algorithm; Polynomial; Polynomial code; Decoding methods; Euclidean algorithm; Computation; List decoding; Computer science; Chinese remainder theorem; Mathematics; Sequential decoding; Arithmetic; Concatenated error correction code; Block code","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.0004365823,0.0001133022,0.0001248339,0.00012746,0.0001593169,0.0001454264,0.0005656246,0.00005518316,0.00007873797],"category_scores_gemma":[0.00002316701,0.0001058475,0.0001345127,0.0003058611,0.00001910204,0.0003253465,0.00007370315,0.0000647917,0.00002587222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002173564,"about_ca_system_score_gemma":0.00006374309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161946,"about_ca_topic_score_gemma":0.00004001443,"domain_scores_codex":[0.9990543,0.00003371956,0.0001610355,0.0003243537,0.0001367181,0.0002898542],"domain_scores_gemma":[0.9991505,0.0002404292,0.00004511353,0.0003946436,0.00004506758,0.0001242739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006332012,0.00002400644,0.00003746302,0.000002900943,0.000009275618,0.000001056241,0.0001080239,0.00005241266,0.0003060661,0.1753549,0.004226605,0.8198709],"study_design_scores_gemma":[0.001050867,0.000176026,0.0001119019,0.00002699181,0.0000120007,0.000009394642,0.00002934629,0.8792912,0.01713151,0.0563205,0.04549482,0.0003454533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003697594,0.00005955762,0.9925282,0.001636851,0.000149387,0.0001574998,0.000001430164,0.000334671,0.004762659],"genre_scores_gemma":[0.08020399,0.000002115685,0.9171887,0.001627124,0.0001887395,0.00001412505,0.000001561405,0.000008181352,0.000765469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8792388,"threshold_uncertainty_score":0.4316336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01713977745125817,"score_gpt":0.256591572027516,"score_spread":0.2394517945762578,"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."}}