{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051693,0.0001180339,0.0001565762,0.0002999428,0.0006483833,0.00006507396,0.001585305,0.00008736691,0.00001185309],"category_scores_gemma":[0.00002950449,0.0001194158,0.000179474,0.0005119292,0.0002087604,0.0001304759,0.0000162898,0.0003276068,0.000004749564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001711317,"about_ca_system_score_gemma":0.0000410328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001263102,"about_ca_topic_score_gemma":0.0001853286,"domain_scores_codex":[0.9990949,0.00008831619,0.0003020534,0.0002237325,0.0001369699,0.0001540535],"domain_scores_gemma":[0.9960954,0.00159876,0.0001164479,0.001914201,0.0002179083,0.0000573272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008864846,0.00113534,0.0000218137,0.00002256219,0.00006329493,2.69561e-7,0.002577312,0.001981043,0.08122248,0.3140623,0.00009289969,0.5987321],"study_design_scores_gemma":[0.0007717398,0.0007097605,0.0001208202,0.0003241767,0.00007537595,0.00002007185,0.0001668842,0.4188714,0.481749,0.09118767,0.005427521,0.0005755485],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01043483,0.0000332636,0.9873825,0.0004419254,0.0002663938,0.0003554535,0.00004646541,0.0002174167,0.0008218043],"genre_scores_gemma":[0.663324,0.00002626727,0.3364409,0.00004190831,0.000006722105,0.0001369315,0.000001925338,0.000006846627,0.00001446575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6528892,"threshold_uncertainty_score":0.4986906,"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."}}