{"id":"W2000901063","doi":"10.1109/lcomm.2011.122211.111737","title":"Efficient Stochastic Decoding of Non-Binary LDPC Codes with Degree-Two Variable Nodes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Degree (music); Algorithm; Binary number; Node (physics); Variable (mathematics); Computer science; List decoding; Mathematics; Block code; Concatenated error correction code; Arithmetic","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.0007332684,0.0001858963,0.0002338698,0.0002378097,0.0003283179,0.00005660718,0.00280577,0.00004372202,0.00000327561],"category_scores_gemma":[0.00006249302,0.0001740787,0.0000538904,0.0007170953,0.0002426735,0.0002862776,0.0006048541,0.000300219,0.00001595751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172789,"about_ca_system_score_gemma":0.0000637534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002281639,"about_ca_topic_score_gemma":0.00002187673,"domain_scores_codex":[0.998607,0.0001792561,0.0003206244,0.0002308531,0.0002625315,0.0003997239],"domain_scores_gemma":[0.9957396,0.0007390376,0.0002507903,0.003039018,0.0001359584,0.0000956045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005205004,0.001783076,0.02001795,0.000147358,0.0002484836,0.00000580097,0.01325985,0.1974232,0.7228755,0.02489553,0.004607745,0.01468341],"study_design_scores_gemma":[0.0006091958,0.0001237035,0.004798634,0.00053203,0.00007612759,0.00008578227,0.0001783595,0.9735651,0.01903052,0.0001375523,0.0002000215,0.0006629964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2181932,0.0001645998,0.7791109,0.0008938707,0.0001753503,0.0002154781,0.000002650139,0.0002916144,0.000952371],"genre_scores_gemma":[0.6035073,0.000003343446,0.396093,0.000302591,0.00001829826,0.00005130443,0.000002185059,0.00001400274,0.000007996961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7761418,"threshold_uncertainty_score":0.7098722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04324977171945868,"score_gpt":0.2985448453377424,"score_spread":0.2552950736182837,"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."}}