{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007990337,0.0001598518,0.0001670219,0.0002567684,0.0003769182,0.0003602957,0.001201925,0.00005920459,0.00007536023],"category_scores_gemma":[0.00001450338,0.0001434588,0.00007404184,0.00102283,0.00003516527,0.0006185421,0.0002681866,0.0002063135,0.0001252117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002553848,"about_ca_system_score_gemma":0.000009870385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007823267,"about_ca_topic_score_gemma":0.00002364075,"domain_scores_codex":[0.9983321,0.0001026106,0.0001884847,0.0006072767,0.0002851974,0.0004843279],"domain_scores_gemma":[0.9988309,0.00005575946,0.00003576114,0.0007614746,0.00005702409,0.0002590596],"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.0001453715,0.001161402,0.0485721,0.00004940282,0.00006669843,0.00001704427,0.03128909,0.0041229,0.005502988,0.515756,0.001634942,0.3916821],"study_design_scores_gemma":[0.001159116,0.0005982249,0.001766972,0.00004695695,0.00001268504,0.0001088085,0.001861686,0.976987,0.01341973,0.002185556,0.0009393309,0.0009139478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2971556,0.00001671405,0.582559,0.0001406258,0.0002176647,0.0001915628,2.636217e-7,0.00047918,0.1192394],"genre_scores_gemma":[0.8774937,0.00000108118,0.1214372,0.0003173034,0.00007896797,0.00001795089,7.51084e-7,0.00001228015,0.0006407031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9728641,"threshold_uncertainty_score":0.585008,"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."}}