{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103348,0.001021293,0.0007145457,0.001211473,0.0007255279,0.001253242,0.0009980244,0.0009564356,0.002688464],"category_scores_gemma":[0.006232818,0.0005484199,0.0006769758,0.001426616,0.0008325775,0.001138302,0.001068013,0.001379984,0.001397218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546835,"about_ca_system_score_gemma":0.002392611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034691,"about_ca_topic_score_gemma":0.003374378,"domain_scores_codex":[0.9986101,0.000336448,0.00008771064,0.0001393522,0.0007117308,0.0001145196],"domain_scores_gemma":[0.997583,0.001301304,0.0001997421,0.0003227708,0.000551868,0.0000412265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007425788,0.0000556594,0.000452187,0.000178319,0.00003749965,0.00008709597,0.0001648143,0.5867699,0.0107002,0.2484292,0.002970202,0.1500807],"study_design_scores_gemma":[0.00001541125,0.00001765303,0.00005367795,0.00002060898,0.00000491769,0.0000556331,0.00001049478,0.9494681,0.003532933,0.04436026,0.002447447,0.00001276648],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003384398,0.000173954,0.9938685,0.0000706233,0.00002009118,0.00004597597,0.00004685278,0.0002607169,0.002128916],"genre_scores_gemma":[0.1624502,0.0009398718,0.830633,0.0001127814,0.00007212837,0.0003877715,0.0004579648,0.0002130264,0.004733246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002688464,"threshold_uncertainty_score":0.01122308,"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."}}