{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901674,0.00009920775,0.0001386957,0.0001785184,0.0001705569,0.00005089707,0.002882055,0.00003371193,0.000001681585],"category_scores_gemma":[0.00004727788,0.000109059,0.00006216306,0.0004119822,0.0001546331,0.0002411938,0.0003665892,0.0001709048,0.00001344657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005782632,"about_ca_system_score_gemma":0.00002589434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003241508,"about_ca_topic_score_gemma":0.0001282658,"domain_scores_codex":[0.9990972,0.000117765,0.0002906402,0.0001709835,0.0001540002,0.0001694008],"domain_scores_gemma":[0.9967557,0.000450228,0.0001727716,0.002515784,0.00008115445,0.00002441062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006079799,0.0004375806,0.004067803,0.00004437299,0.00005448608,0.000004997129,0.001867491,0.008934187,0.7647808,0.1568555,0.03898406,0.02396261],"study_design_scores_gemma":[0.001203226,0.0002007886,0.01367919,0.0007383364,0.0001036249,0.0001514422,0.0001787322,0.6786799,0.2629587,0.032672,0.00739638,0.00203774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06137629,0.0001420964,0.9312075,0.005090683,0.0001486377,0.0001247367,0.000001916168,0.0004608367,0.001447256],"genre_scores_gemma":[0.7457871,0.000005877932,0.2537833,0.0003551316,0.00001629723,0.0000235766,0.000002552825,0.000007828023,0.00001830333],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6844108,"threshold_uncertainty_score":0.5355622,"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."}}