{"id":"W2064102818","doi":"10.1109/isit.2005.1523516","title":"A degree-matched check node approximation for LDPC decoding","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Degree (music); Decoding methods; Low-density parity-check code; Node (physics); Mathematics; Algorithm; Simple (philosophy); Factor graph; Computer science; 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.0004567703,0.0001165524,0.0001293041,0.0001021619,0.0001055996,0.0001243291,0.0006317893,0.0000654278,0.00001324452],"category_scores_gemma":[0.0001356897,0.0001085488,0.00007022322,0.0002208606,0.00001148351,0.0006069983,0.0001399392,0.00007930925,0.00004495171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009204441,"about_ca_system_score_gemma":0.00003523074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002055873,"about_ca_topic_score_gemma":0.00006897009,"domain_scores_codex":[0.9990325,0.00001964913,0.0002181397,0.0003177511,0.0001533716,0.0002586161],"domain_scores_gemma":[0.9991878,0.0001285672,0.00008747343,0.0004482707,0.00009511699,0.00005280006],"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.00001342258,0.0001502093,0.0008991347,0.00006857256,0.00002095638,0.00000139971,0.00287815,0.000258499,0.02497396,0.1154211,0.01506633,0.8402483],"study_design_scores_gemma":[0.0002231597,0.00004014651,0.0002058679,0.00002182163,0.00000409907,0.00001229598,0.00003472557,0.8484941,0.141965,0.00525965,0.003527178,0.0002120028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00934089,0.00001963161,0.9756289,0.002036268,0.0001331152,0.0003311608,3.7449e-7,0.001575598,0.01093412],"genre_scores_gemma":[0.3728493,0.000001318828,0.6261691,0.0003996889,0.00006285444,0.00006636651,0.000001062125,0.000008343682,0.0004420475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8482356,"threshold_uncertainty_score":0.4426494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05704207632537503,"score_gpt":0.3040474406461272,"score_spread":0.2470053643207522,"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."}}