{"id":"W2027136297","doi":"10.1587/transinf.2013lop0010","title":"Asynchronous Stochastic Decoding of LDPC Codes: Algorithm and Simulation Model","year":2014,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; McGill University","funders":"Core Research for Evolutional Science and Technology; University of Tokyo; Japan Society for the Promotion of Science; Synopsys","keywords":"Computer science; Decoding methods; Asynchronous communication; Parallel computing; Scheduling (production processes); Algorithm; Low-density parity-check code; Computation; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004137206,0.0001006427,0.0001520028,0.0002374338,0.0001567393,0.0001363896,0.0001195325,0.00006799077,8.407616e-7],"category_scores_gemma":[0.00002306024,0.0000981449,0.00002417573,0.0001524703,0.00002644978,0.001215032,0.000005340295,0.00009831479,0.000003983699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003459373,"about_ca_system_score_gemma":0.00002384331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007417773,"about_ca_topic_score_gemma":0.00000586619,"domain_scores_codex":[0.9991808,0.00004501776,0.0003692786,0.0001113009,0.0001867791,0.0001068472],"domain_scores_gemma":[0.9992324,0.0002075599,0.0001754298,0.0002026223,0.0001264988,0.00005545596],"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.000003100342,0.000009782648,0.000002952328,0.00005690368,0.00000584493,2.661664e-8,0.001858189,0.8087276,0.00002378733,0.002548417,0.000003617637,0.1867597],"study_design_scores_gemma":[0.0001984616,0.00008803468,0.00002098128,0.00008038302,0.000007444183,0.00001252657,0.0002137228,0.998889,0.0001437513,0.0001992175,0.00004690111,0.00009959896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005009111,0.0000183221,0.9938244,0.00002976262,0.0001858947,0.0002233134,0.000006468321,0.0002269728,0.0004757158],"genre_scores_gemma":[0.9537503,0.000007795396,0.04614831,0.00004605768,0.000008254791,0.00002121593,0.000001662754,0.000003988461,0.00001242203],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9487412,"threshold_uncertainty_score":0.4002233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01556911225334347,"score_gpt":0.2580003604589923,"score_spread":0.2424312482056488,"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."}}