{"id":"W1996804168","doi":"10.1109/bsc.2008.4563216","title":"Successive relaxation for decoding of LDPC codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Belief propagation; Additive white Gaussian noise; Binary number; Error floor; Computer science; Quantization (signal processing); Gaussian; Relaxation (psychology); Mathematics; Channel (broadcasting); Arithmetic; Telecommunications; Physics","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.001142512,0.0006760319,0.0007656735,0.0003747538,0.0002521641,0.000572876,0.0006466395,0.0007720146,0.001314683],"category_scores_gemma":[0.005323551,0.0003390927,0.0006629741,0.0006866584,0.00100758,0.0006154511,0.0007926204,0.001489252,0.0003364881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007121521,"about_ca_system_score_gemma":0.0008550977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002327505,"about_ca_topic_score_gemma":0.001287012,"domain_scores_codex":[0.9993361,0.0003406364,0.00002036835,0.00006159096,0.0001918243,0.00004956346],"domain_scores_gemma":[0.9983785,0.00122222,0.0001091988,0.0001048503,0.0001510356,0.00003405828],"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.00009243256,0.00001808807,0.0001642653,0.0001633722,0.00002972213,0.00007801505,0.0001045164,0.8967122,0.00573813,0.06818137,0.0006808352,0.02803713],"study_design_scores_gemma":[0.000008701498,0.00002368165,0.00002549247,0.000008161167,0.000002520618,0.0000207531,0.000005539797,0.9851372,0.00125962,0.01305179,0.0004512775,0.000005206502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01560794,0.000456888,0.9812891,0.0001787276,0.00002600117,0.00002651977,0.00004166642,0.0001229462,0.002250287],"genre_scores_gemma":[0.4522489,0.001280386,0.5416824,0.0001456714,0.00009522572,0.000216243,0.0002759194,0.0001280276,0.003927327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002327505,"threshold_uncertainty_score":0.006042302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03911459514408671,"score_gpt":0.291403472840777,"score_spread":0.2522888776966903,"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."}}