{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002005302,0.0001391998,0.0001766545,0.0002650963,0.0003551426,0.00007726688,0.002226724,0.00007187964,0.00007533717],"category_scores_gemma":[0.00002206754,0.0001460764,0.0001109617,0.0005660192,0.0001434485,0.0005162827,0.00002385835,0.0003539588,0.00009732978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007315044,"about_ca_system_score_gemma":0.00006199305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004591867,"about_ca_topic_score_gemma":0.0002398112,"domain_scores_codex":[0.9989065,0.0001366099,0.0003395954,0.0002202132,0.000200433,0.0001966272],"domain_scores_gemma":[0.9960546,0.0007626451,0.0001376065,0.00277694,0.0001946377,0.00007352408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002923264,0.004633321,0.0002768377,0.0001297473,0.0004906065,0.000002289627,0.01308879,0.03976977,0.1368213,0.1058633,0.007498127,0.6913968],"study_design_scores_gemma":[0.0005401999,0.000301995,0.001195396,0.000308313,0.00006727457,0.0000326215,0.0002581003,0.8962834,0.08299957,0.01675481,0.000561683,0.0006966674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006589045,0.00006543742,0.9890699,0.00102093,0.0002142411,0.0003203638,0.00000727909,0.0005640775,0.00214874],"genre_scores_gemma":[0.8593544,0.0000531645,0.1401068,0.0001071209,0.000005267148,0.0001830737,9.951578e-7,0.00001383663,0.0001753452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8565136,"threshold_uncertainty_score":0.5956824,"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."}}