{"id":"W2536217578","doi":"10.17760/d20211572","title":"Efficient algorithms for stochastic decoding of LDPC codes","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo; Gilead Sciences; McKnight Foundation","keywords":"Low-density parity-check code; Computer science; Decoding methods; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; List decoding; Theoretical computer science; Block code; Concatenated error correction code; Computer engineering; Parallel computing","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004057968,0.0002374826,0.000362482,0.0002926899,0.00009437663,0.00004717468,0.001006196,0.0001898525,0.00001151189],"category_scores_gemma":[0.0002750075,0.0001869909,0.0001686626,0.0001906238,0.00001959577,0.00005603154,0.00007925803,0.0001107641,0.000008576208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007417816,"about_ca_system_score_gemma":0.0001495312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003476337,"about_ca_topic_score_gemma":0.00005492393,"domain_scores_codex":[0.9984805,0.00002463914,0.0004070709,0.0004976417,0.0003071749,0.0002829734],"domain_scores_gemma":[0.9980701,0.0005595225,0.0003789636,0.0005483273,0.0003884376,0.00005461857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000122741,0.0003534354,0.00002974497,0.001166201,0.0001945982,0.000005701755,0.005834769,0.001085057,0.03872787,0.1348753,0.004248323,0.8133563],"study_design_scores_gemma":[0.0006135627,0.0005117623,0.0001411482,0.001948703,0.00007725423,0.00001100724,0.0003246826,0.7369303,0.2440547,0.01412631,0.0001651061,0.00109543],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005552933,0.00009921544,0.9874578,0.00003444267,0.001463201,0.000578177,0.00001139111,0.0005609279,0.004241935],"genre_scores_gemma":[0.453859,0.000005123274,0.5382277,0.00002995378,0.0001132928,0.0002288957,0.00003797297,0.00005315414,0.007444958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8122609,"threshold_uncertainty_score":0.7625269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0258137914912377,"score_gpt":0.3220486601179452,"score_spread":0.2962348686267075,"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."}}