{"id":"W2131239166","doi":"10.1109/lcomm.2006.060570","title":"Stochastic decoding of LDPC codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Berlekamp–Welch algorithm; Algorithm; Factor graph; List decoding; Sequential decoding; Code (set theory); Throughput; Theoretical computer science; Concatenated error correction code; Error floor; Block code; Telecommunications; Wireless","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.0008276216,0.0005485344,0.0007666511,0.000695408,0.0006335585,0.0008513454,0.0006291539,0.0007389174,0.001012019],"category_scores_gemma":[0.006525315,0.0003239654,0.0005337417,0.0008370417,0.00083648,0.0006061208,0.001047043,0.001041514,0.0007166035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008481959,"about_ca_system_score_gemma":0.001773348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002001142,"about_ca_topic_score_gemma":0.002262899,"domain_scores_codex":[0.9978808,0.0005820406,0.00009608979,0.0002108902,0.001087503,0.0001427046],"domain_scores_gemma":[0.9979131,0.0009910809,0.0001630891,0.0003562251,0.0005118588,0.00006458414],"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.0001638372,0.000041978,0.0007283117,0.0001834921,0.00007868031,0.0002402582,0.0001928749,0.5577887,0.03150052,0.2704169,0.002667063,0.1359973],"study_design_scores_gemma":[0.00001465555,0.00002553566,0.000116776,0.00001979187,0.000007450782,0.0001118397,0.000006824544,0.942885,0.01286189,0.04064655,0.003284684,0.00001903564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009122904,0.0001123417,0.9869112,0.0000928693,0.00003463703,0.00003065143,0.00008433764,0.0004063438,0.00320464],"genre_scores_gemma":[0.4845614,0.0007114657,0.5062662,0.0002739578,0.0001294037,0.0002416898,0.0006181917,0.0002650801,0.006932685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002001142,"threshold_uncertainty_score":0.00615406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02927228328082015,"score_gpt":0.2840308639770852,"score_spread":0.2547585806962651,"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."}}