{"id":"W2144611931","doi":"10.1109/tsp.2008.929337","title":"Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nortel (Canada); McGill University","funders":"","keywords":"Decoding methods; List decoding; Berlekamp–Welch algorithm; Algorithm; Computer science; Sequential decoding; Block (permutation group theory); Block code; Mathematics; Theoretical computer science; Concatenated error correction code; Combinatorics","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.001118751,0.0005506336,0.000512276,0.0004448311,0.0004007028,0.0008877715,0.0005194403,0.0006427884,0.001429969],"category_scores_gemma":[0.005519603,0.0002653391,0.0003394218,0.0007158461,0.0007075611,0.0007625402,0.000779114,0.0005503506,0.0004945259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007495115,"about_ca_system_score_gemma":0.0013075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002392791,"about_ca_topic_score_gemma":0.00392103,"domain_scores_codex":[0.9986069,0.0005201061,0.00005008444,0.00009136957,0.0006115061,0.0001200423],"domain_scores_gemma":[0.9967434,0.001997248,0.0002987489,0.0003417831,0.0005577612,0.00006109779],"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.0004048859,0.00005861415,0.001344079,0.0001531729,0.00007945013,0.0002520698,0.0001509645,0.7723306,0.02344241,0.1351678,0.001789638,0.06482624],"study_design_scores_gemma":[0.00001442545,0.00004819239,0.0002069213,0.00001267331,0.000008610084,0.00008361451,0.000009883832,0.9728971,0.009975189,0.01612512,0.0006062344,0.000012056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08181042,0.0002681866,0.9098159,0.0003147484,0.00006280606,0.00005627687,0.0001438512,0.0004259101,0.007101902],"genre_scores_gemma":[0.8640634,0.0004052555,0.1302017,0.0001474204,0.0000667723,0.00008191348,0.0002787871,0.00007253791,0.004682312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002392791,"threshold_uncertainty_score":0.005916595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02652388012649342,"score_gpt":0.2598790656467982,"score_spread":0.2333551855203048,"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."}}