{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741636,0.0008977481,0.0007020707,0.001006079,0.0004646518,0.0006049849,0.001028342,0.0007244877,0.001433338],"category_scores_gemma":[0.002499466,0.0004046371,0.0007311086,0.0006679918,0.000650591,0.0008028284,0.001048639,0.00134571,0.00101538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005479543,"about_ca_system_score_gemma":0.001022237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009658111,"about_ca_topic_score_gemma":0.001194424,"domain_scores_codex":[0.9990137,0.0002107315,0.0000524909,0.00009430764,0.0005682301,0.00006054736],"domain_scores_gemma":[0.9989179,0.0005065371,0.0001131974,0.0001439453,0.0002784572,0.00003997254],"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.0002725681,0.00009723608,0.0009248644,0.0004418901,0.0001690686,0.000438923,0.0004013809,0.1014139,0.1316872,0.05642315,0.002871567,0.7048581],"study_design_scores_gemma":[0.00005433635,0.0001885545,0.0004137333,0.00004992597,0.00005512584,0.0007486169,0.0000281097,0.889528,0.08477565,0.01607167,0.008007419,0.00007895125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002826447,0.0001865959,0.9959177,0.00004501783,0.0000303226,0.00002566588,0.00001770482,0.0002811855,0.0006694326],"genre_scores_gemma":[0.1048555,0.0004211502,0.8915431,0.00007421197,0.0000595763,0.0001423587,0.0001127705,0.00008508201,0.002706176],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001433338,"threshold_uncertainty_score":0.004795015,"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."}}