{"id":"W2167340446","doi":"10.1109/tcomm.2011.121410.090612","title":"Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Sequential decoding; List decoding; Parity-check matrix; Berlekamp–Welch algorithm; Algorithm; Computer science; Low-density parity-check code; Binary number; Concatenated error correction code; Binary symmetric channel; Theoretical computer science; Mathematics; Block code; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052826,0.001195393,0.0007773268,0.001443107,0.0004392377,0.0007545005,0.001315556,0.0008111959,0.001616288],"category_scores_gemma":[0.003860133,0.000555808,0.0008562845,0.0010318,0.0007039647,0.00110258,0.001342985,0.001629771,0.001096649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006951556,"about_ca_system_score_gemma":0.001033048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008905415,"about_ca_topic_score_gemma":0.001400919,"domain_scores_codex":[0.9985225,0.000386452,0.00009055651,0.0001077131,0.0007962349,0.00009654862],"domain_scores_gemma":[0.9982138,0.0009387814,0.0001926549,0.0001948967,0.0004134151,0.00004647936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003150353,0.0001062287,0.0008559061,0.000604529,0.0001779774,0.0003201829,0.0005856036,0.147392,0.07159094,0.08753776,0.002850221,0.6876636],"study_design_scores_gemma":[0.0000618118,0.0001388759,0.0003235632,0.00006790707,0.00004397261,0.0004639773,0.00003785152,0.9118726,0.0534024,0.02671232,0.006809441,0.00006526561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00241316,0.0002941855,0.9962478,0.00004095862,0.00002382795,0.00002974449,0.00001799839,0.0002454587,0.000686773],"genre_scores_gemma":[0.069906,0.0006970785,0.9265738,0.00005879856,0.00005121654,0.0001824886,0.0001122384,0.00008042261,0.002338059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001616288,"threshold_uncertainty_score":0.005407035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02556351269103955,"score_gpt":0.3060731576643248,"score_spread":0.2805096449732852,"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."}}