{"id":"W2111916081","doi":"10.1109/isit.1994.394851","title":"Fast parallel algorithms for decoding Reed-Solomon codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Berlekamp–Welch algorithm; Remainder; Parallel algorithm; Reed–Solomon error correction; List decoding; Parallel computing; Arithmetic; Sequential decoding; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008045151,0.001325366,0.0007136743,0.001287204,0.000843811,0.001568375,0.001108469,0.0009496577,0.008747295],"category_scores_gemma":[0.003234392,0.0006016329,0.0006823643,0.001499543,0.0006119743,0.002300583,0.001139664,0.001291295,0.004931544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061122,"about_ca_system_score_gemma":0.001331898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001530586,"about_ca_topic_score_gemma":0.002289465,"domain_scores_codex":[0.9989606,0.0001842085,0.00007773667,0.0001489551,0.0005229214,0.0001055308],"domain_scores_gemma":[0.9989999,0.0003614493,0.00007591623,0.0001736091,0.0003579248,0.0000313138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004099162,0.0001156371,0.0004820638,0.0004170379,0.00006487855,0.0001795736,0.0002544088,0.1194699,0.01962455,0.1255159,0.01945816,0.714008],"study_design_scores_gemma":[0.0003317712,0.0002491977,0.0003927149,0.0001094023,0.00007291203,0.0005303469,0.0001058646,0.6738762,0.04116638,0.2123714,0.07069575,0.00009797604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007202312,0.001071344,0.9810688,0.000242377,0.0002018056,0.000116106,0.0001878002,0.002447874,0.007461584],"genre_scores_gemma":[0.07615686,0.001785158,0.9057083,0.0001491857,0.0002451483,0.0004210002,0.0009386907,0.0004500624,0.01414571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008747295,"threshold_uncertainty_score":0.02926266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04740529336886821,"score_gpt":0.261510646682414,"score_spread":0.2141053533135457,"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."}}