{"id":"W2152382476","doi":"10.1109/tcomm.2009.10.080005","title":"Comments on successive relaxation for decoding of LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Additive white Gaussian noise; Code word; Belief propagation; Binary number; Relaxation (psychology); Computer science; Bit error rate; Mathematics; Frequency domain; Channel (broadcasting); Arithmetic; Telecommunications","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.0003068857,0.0001328234,0.0001708784,0.0002711039,0.0005272536,0.0000513356,0.001687911,0.00007725822,0.000003569248],"category_scores_gemma":[0.00004802033,0.0001419605,0.0001195723,0.0004411424,0.00006086197,0.0003280044,0.000006927397,0.0002643524,0.000008130928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115906,"about_ca_system_score_gemma":0.00004651269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003593997,"about_ca_topic_score_gemma":0.00008690875,"domain_scores_codex":[0.9989532,0.0001346801,0.0003438592,0.0002244971,0.0001778046,0.000165931],"domain_scores_gemma":[0.9963279,0.001202169,0.0002402222,0.001968666,0.0002120858,0.00004893194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001344488,0.003846306,0.000080168,0.00004526599,0.0001412566,8.975026e-7,0.005268328,0.00841552,0.0222364,0.2285264,0.002676115,0.7286289],"study_design_scores_gemma":[0.001599663,0.002516517,0.001003076,0.0006794806,0.0001080079,0.00001147888,0.0002346501,0.437669,0.5052355,0.04688907,0.003235077,0.0008184639],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001972184,0.00003117786,0.9899147,0.004892463,0.0001922526,0.0004494561,0.0000215691,0.0003951817,0.002131064],"genre_scores_gemma":[0.8328992,0.00008593496,0.1663935,0.0004046299,0.000006181445,0.0001110873,0.000005487536,0.000008932027,0.00008504472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.830927,"threshold_uncertainty_score":0.5788979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05469542822861342,"score_gpt":0.3447178290045503,"score_spread":0.2900224007759369,"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."}}