{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002538031,0.0002325443,0.0003172348,0.0002946188,0.0006551344,0.00006228041,0.0005095737,0.0000993922,0.000006123679],"category_scores_gemma":[0.000007059643,0.0002095666,0.00007568312,0.000833389,0.0001498546,0.0006042962,0.000005768398,0.000419379,0.000007418676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006749228,"about_ca_system_score_gemma":0.0002120991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001419991,"about_ca_topic_score_gemma":0.00005870837,"domain_scores_codex":[0.9983456,0.00006383794,0.0003447681,0.0004582224,0.0004861031,0.0003015345],"domain_scores_gemma":[0.9988387,0.0002152471,0.0002420542,0.0003184367,0.0002908813,0.000094672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008079623,0.00247029,0.0008339736,0.001056365,0.0003061164,0.0003341566,0.01422066,0.537524,0.09469862,0.0003712852,0.0001584736,0.3472181],"study_design_scores_gemma":[0.0005493623,0.0006286561,0.0003010645,0.000664965,0.00007789046,0.0005017295,0.0001174979,0.3359692,0.6601796,0.0004433186,0.000006430771,0.0005602524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2444462,0.00005122766,0.7546614,0.00005882178,0.00007515971,0.0001282467,0.000002114243,0.0005229255,0.00005386747],"genre_scores_gemma":[0.8582579,0.000008775489,0.1415817,0.00004609919,0.00002864778,0.00001450566,2.812434e-7,0.00002100805,0.00004105013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6138118,"threshold_uncertainty_score":0.8545879,"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."}}