{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002588237,0.0001089509,0.0001257665,0.00009471436,0.0002082877,0.0001521528,0.0006426827,0.00004744128,0.0000926072],"category_scores_gemma":[0.00002301587,0.000100057,0.0001230689,0.0002691878,0.00003832398,0.0003096052,0.0001129413,0.00006228603,0.00005992402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009810258,"about_ca_system_score_gemma":0.000003917637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005501734,"about_ca_topic_score_gemma":0.000008951674,"domain_scores_codex":[0.9990923,0.00002958806,0.0001537242,0.0003140001,0.0001169651,0.0002934644],"domain_scores_gemma":[0.9992903,0.0001751578,0.00004268832,0.0003704551,0.00004178041,0.00007955368],"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.000005681052,0.00006180788,0.0001983074,0.00000791087,0.00001828574,0.000003425218,0.0005251645,0.00005673832,0.0002530498,0.7039492,0.004041046,0.2908794],"study_design_scores_gemma":[0.001024323,0.0003997683,0.0003066596,0.00003068391,0.00001489433,0.00003335335,0.0001459277,0.8311461,0.002011292,0.1402362,0.02406803,0.0005827521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001860474,0.0001858912,0.9828581,0.0006172557,0.0002413039,0.0001434791,0.000002067115,0.0003333929,0.01375803],"genre_scores_gemma":[0.4914466,0.00003889953,0.5057811,0.000478639,0.0001024601,0.00004524534,0.000001406297,0.000009704064,0.002095967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8310894,"threshold_uncertainty_score":0.4080204,"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."}}