{"id":"W2019751845","doi":"10.1049/el:20030217","title":"Iterative decoding using stochastic computation","year":2003,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computation; Computer science; Sequential decoding; Algorithm; List decoding; Code (set theory); Simple (philosophy); Berlekamp–Welch algorithm; Iterative method; Theoretical computer science; Concatenated error correction code; Set (abstract data type)","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.0005195222,0.0003851143,0.0005310063,0.0004051665,0.0004639193,0.0008200938,0.0006902122,0.000702722,0.001346377],"category_scores_gemma":[0.001647254,0.0002228587,0.0003890801,0.0005187842,0.0006343891,0.0006269873,0.000828428,0.0007054345,0.0005975922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005420715,"about_ca_system_score_gemma":0.001090828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107666,"about_ca_topic_score_gemma":0.001921024,"domain_scores_codex":[0.9995103,0.000132118,0.00002734839,0.00006148109,0.0002126413,0.00005607653],"domain_scores_gemma":[0.9994215,0.0002664445,0.0000366491,0.00009970964,0.0001494155,0.00002631486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002046004,0.00008251183,0.0008464132,0.0001202229,0.00008383008,0.0002241726,0.0001535075,0.5557861,0.0471149,0.2595495,0.002011316,0.1338229],"study_design_scores_gemma":[0.00001706335,0.00004829195,0.00007623729,0.000008888032,0.00001045239,0.00007375373,0.000004062537,0.9686836,0.009755541,0.01956401,0.001744655,0.00001356903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168757,0.00009816259,0.9775912,0.0001001841,0.00004072571,0.0000499517,0.00003216892,0.0004064231,0.004805538],"genre_scores_gemma":[0.5058234,0.0003039241,0.4875805,0.000133065,0.0000517001,0.0001951147,0.0001242566,0.00008209971,0.005705943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001346377,"threshold_uncertainty_score":0.004504085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01957735228012552,"score_gpt":0.2767375105798688,"score_spread":0.2571601582997433,"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."}}