{"id":"W2105050988","doi":"10.1109/ismvl.2012.35","title":"Asynchronous Stochastic Decoding of Low-Density Parity-Check Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Decoding methods; Decodes; Low-density parity-check code; Algorithm; Computation; Scheduling (production processes); Parallel computing; Theoretical computer science; Mathematics; Computer network; Mathematical optimization","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.0003767341,0.0002751052,0.0002559776,0.0002912678,0.0003632196,0.0004586558,0.0005249475,0.0002647245,0.0007039197],"category_scores_gemma":[0.001562907,0.0001362292,0.0001734446,0.0002755441,0.0003044655,0.0004897425,0.0003684965,0.0003627661,0.0002749866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004718346,"about_ca_system_score_gemma":0.0007288303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007454221,"about_ca_topic_score_gemma":0.001482713,"domain_scores_codex":[0.9995692,0.000105432,0.00002308744,0.00006071395,0.0002069809,0.00003448987],"domain_scores_gemma":[0.9993312,0.000273053,0.00009701046,0.0001299181,0.0001404812,0.0000283501],"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.0003966083,0.0001352345,0.002365216,0.0001987625,0.00004112727,0.0002649165,0.0001881402,0.4259054,0.1714202,0.1944711,0.001915703,0.2026975],"study_design_scores_gemma":[0.00001370992,0.00005192424,0.0001489812,0.000005860538,0.000006554403,0.00006973823,0.000005064961,0.9632353,0.02757693,0.007245546,0.001632316,0.00000820212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04755358,0.0000964556,0.9493495,0.00006210341,0.00003360096,0.00002591417,0.00003255878,0.0004435003,0.002402704],"genre_scores_gemma":[0.7900351,0.0001857947,0.207135,0.00006437251,0.00004413079,0.00005060952,0.0001001802,0.0000722448,0.002312472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0007454221,"threshold_uncertainty_score":0.003423393,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02041635535331025,"score_gpt":0.2716427372605129,"score_spread":0.2512263819072026,"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."}}