{"id":"W1486886369","doi":"10.1109/mwscas.1993.343002","title":"An approach to double error correcting Reed-Solomon decoding without Chien search","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Arithmetic; Code (set theory); Search algorithm; Sequential decoding; Symbol (formal); Theoretical computer science; Mathematics; Concatenated error correction code; Set (abstract data type); 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.0003427029,0.0007724664,0.0005626705,0.001195989,0.0008407019,0.001176253,0.0008794068,0.0009150517,0.004707528],"category_scores_gemma":[0.001373466,0.0003582967,0.0005924016,0.0007381717,0.0007089002,0.001125643,0.001026514,0.00139704,0.00327014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007329778,"about_ca_system_score_gemma":0.001543318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001419696,"about_ca_topic_score_gemma":0.002087121,"domain_scores_codex":[0.999339,0.00008493047,0.00003560942,0.0001023965,0.0003859898,0.00005199034],"domain_scores_gemma":[0.9995456,0.0001217909,0.00002668393,0.00008961516,0.0001968876,0.00001938241],"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.000145317,0.00007279682,0.00039257,0.0003373251,0.000062896,0.0003829074,0.0002347171,0.04486584,0.06687263,0.2337833,0.008460084,0.6443897],"study_design_scores_gemma":[0.00007856995,0.0003091257,0.0003432991,0.0001685824,0.00006989516,0.002948364,0.00009021827,0.5861682,0.1081986,0.1496305,0.1518447,0.0001499646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001702386,0.0003965112,0.9927891,0.0001168689,0.0001340974,0.00004759974,0.00003081882,0.0005678555,0.004214905],"genre_scores_gemma":[0.03954197,0.0007332629,0.9456629,0.0001762735,0.00009496809,0.0001154393,0.0001499498,0.0001682912,0.01335693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004707528,"threshold_uncertainty_score":0.0157482,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07511058565965957,"score_gpt":0.2973316850023007,"score_spread":0.2222210993426411,"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."}}