{"id":"W2110262961","doi":"10.1109/istel.2010.5734050","title":"Iterative soft decoding of Reed-Solomon codes using information correction","year":2010,"lang":"en","type":"article","venue":"","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; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Computer science; Belief propagation; Parity-check matrix; Algorithm; Concatenated error correction code; Low-density parity-check code; Binary symmetric channel; Serial concatenated convolutional codes; Theoretical computer science; Arithmetic; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629704,0.000759807,0.0006692191,0.0009303666,0.0004565415,0.0006983013,0.0009184779,0.0007831354,0.0008587035],"category_scores_gemma":[0.002631471,0.0003315557,0.0005907033,0.0005503123,0.0006856053,0.0007680327,0.000911362,0.0009685392,0.0005180291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005137831,"about_ca_system_score_gemma":0.001022162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009255119,"about_ca_topic_score_gemma":0.001121684,"domain_scores_codex":[0.9990741,0.0002097116,0.00005412149,0.00009357074,0.0005032806,0.00006519376],"domain_scores_gemma":[0.9983886,0.0007201008,0.0001902962,0.0002117137,0.0004367245,0.00005253927],"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.0004239216,0.0001125556,0.001380232,0.0004070757,0.0001766058,0.0005248715,0.000385412,0.1493474,0.1511177,0.04496779,0.002476626,0.64868],"study_design_scores_gemma":[0.00005386957,0.0001991574,0.0004565814,0.00003937087,0.00004912234,0.0005868621,0.00002317281,0.8625378,0.1195208,0.01135542,0.005105018,0.00007281383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200906,0.0002902242,0.9859243,0.00008181982,0.00006525665,0.0000384696,0.00002719638,0.0004679407,0.001095788],"genre_scores_gemma":[0.2689879,0.0004916776,0.7251209,0.0001130315,0.00008715435,0.0001385185,0.0001273935,0.0001029178,0.004830498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009303666,"threshold_uncertainty_score":0.003727734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01090130175463782,"score_gpt":0.243398353821196,"score_spread":0.2324970520665582,"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."}}