{"id":"W2153505774","doi":"10.1109/tcomm.2013.012913.110340","title":"Stochastic Decoding of LDPC Codes over GF(q)","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Code word; Computational complexity theory; List decoding; Computer science; Galois theory; Mathematics; Block code; Concatenated error correction code; Discrete mathematics","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.0007865941,0.000380852,0.0004067661,0.0004197615,0.0004006895,0.0006306428,0.0004957573,0.0004092845,0.0006682856],"category_scores_gemma":[0.004859622,0.0002135446,0.0002726686,0.0006276515,0.0005484889,0.0006054427,0.0006545593,0.0004950464,0.0002748226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007403109,"about_ca_system_score_gemma":0.002142469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003042276,"about_ca_topic_score_gemma":0.004985947,"domain_scores_codex":[0.998735,0.0003720491,0.00007402386,0.0001121433,0.0005944154,0.0001123148],"domain_scores_gemma":[0.9977374,0.001170221,0.0002711257,0.0003482262,0.0004268081,0.00004621723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002978329,0.00006253259,0.001903167,0.0001974074,0.0000629957,0.0001603076,0.0001950287,0.744656,0.03727077,0.1011936,0.001192599,0.1128077],"study_design_scores_gemma":[0.00001658731,0.00004252974,0.0002379387,0.00001311959,0.000005980443,0.00007816116,0.00001157544,0.9707817,0.01552049,0.01239123,0.0008917287,0.000008974678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08535616,0.0001580874,0.910216,0.000144269,0.00001968949,0.00006075894,0.0001127385,0.000481245,0.003451042],"genre_scores_gemma":[0.704197,0.0002925989,0.2919295,0.000102144,0.00002658928,0.00008956022,0.0003523504,0.0001046608,0.002905466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003042276,"threshold_uncertainty_score":0.006049156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03690478225068595,"score_gpt":0.2987785504168444,"score_spread":0.2618737681661584,"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."}}