{"id":"W2159333237","doi":"10.1109/icc.2009.5198625","title":"A Low Complexity Iterative Technique for Soft Decision Decoding of Reed-Solomon Codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Parity-check matrix; Algorithm; Computer science; Factor graph; Low-density parity-check code; Tanner graph; Linear code; Binary number; Block code; Concatenated error correction code; Theoretical computer science; Mathematics; Arithmetic","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.0005608393,0.0001101906,0.0001954051,0.0001540724,0.0001389037,0.00006796701,0.0005797833,0.00005686524,0.00001220677],"category_scores_gemma":[0.00008452068,0.00009649665,0.0001323159,0.0003714674,0.00006849807,0.0002938045,0.00008642827,0.00006773802,0.000001784653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000135022,"about_ca_system_score_gemma":0.00001921285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000334087,"about_ca_topic_score_gemma":0.00001118436,"domain_scores_codex":[0.9991074,0.00004801804,0.0002414775,0.000280418,0.0001347691,0.0001878767],"domain_scores_gemma":[0.9989398,0.0004185165,0.00009371316,0.0003681543,0.000128182,0.00005164468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007970866,0.0001186387,0.0000874248,0.00001250755,0.000006110078,0.00000132146,0.0003851779,0.00001617673,0.04189213,0.826369,0.0002764435,0.1307553],"study_design_scores_gemma":[0.0002615365,0.0005705914,0.0005622998,0.00009487307,0.000003805651,0.000007370734,0.00002102171,0.01076074,0.2692337,0.718223,0.0001141709,0.0001469335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01629012,0.0000220735,0.9811738,0.0001640619,0.00005723509,0.0003436962,0.000004568682,0.0001419513,0.001802574],"genre_scores_gemma":[0.6133149,0.000002086785,0.3864672,0.000176509,0.00001098196,0.00001311817,0.000001090402,0.000002157593,0.00001189241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5970249,"threshold_uncertainty_score":0.3935019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03075280943614378,"score_gpt":0.2966339844826327,"score_spread":0.2658811750464889,"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."}}