{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000619468,0.0003701443,0.0003965616,0.0003811197,0.0004399075,0.0006327089,0.0007692442,0.0005431046,0.0009065528],"category_scores_gemma":[0.005205557,0.0001883318,0.0003204751,0.0005654753,0.0006995148,0.001101495,0.0006113138,0.0008952206,0.0004816433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016762,"about_ca_system_score_gemma":0.0007907749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004323752,"about_ca_topic_score_gemma":0.004075977,"domain_scores_codex":[0.9995036,0.0001140549,0.00001297436,0.00004542623,0.0002793553,0.00004453848],"domain_scores_gemma":[0.9990502,0.0005071754,0.0000602281,0.0002299028,0.0001253649,0.00002703872],"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.0001842413,0.00003051439,0.001422002,0.00006733193,0.00002691566,0.0001852079,0.000162307,0.7875649,0.01283556,0.1579354,0.0008011077,0.03878448],"study_design_scores_gemma":[0.000003911014,0.00001414146,0.00008405076,0.000005328808,0.000004722805,0.00006382455,0.000008358565,0.983751,0.002166992,0.01312832,0.00076245,0.000006973792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05483159,0.0003538954,0.9384713,0.0001535124,0.00004208722,0.0000313561,0.000047111,0.0003000734,0.005769076],"genre_scores_gemma":[0.7558513,0.0006241823,0.238627,0.0001010262,0.00003665019,0.00004755029,0.00008319122,0.00008253051,0.004546598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004323752,"threshold_uncertainty_score":0.008597195,"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."}}