{"id":"W2119412051","doi":"10.1109/ciss.2006.286585","title":"A New Fast Density Evolution Method for LDPC Codes Using Higher Order Statistics","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Algorithm; Bipartite graph; Gaussian; Computer science; Code (set theory); Matching (statistics); Decoding methods; Message passing; Mathematics; Graph; Theoretical computer science; Statistics; Parallel computing","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.0003388395,0.0001329239,0.0001576537,0.00008927868,0.0001407232,0.0001151397,0.0003441838,0.00007208711,0.00001711279],"category_scores_gemma":[0.00006671761,0.0001268363,0.00003865178,0.0003445277,0.00001630756,0.0002456036,0.0001438467,0.00008163777,0.000006181473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00016014,"about_ca_system_score_gemma":0.0001508327,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006774826,"about_ca_topic_score_gemma":0.001146959,"domain_scores_codex":[0.9989368,0.00006605143,0.0002053884,0.0003410009,0.0001860565,0.0002646754],"domain_scores_gemma":[0.9989643,0.0002416193,0.00009876924,0.0003552038,0.0002885061,0.00005160439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001186998,0.00005955987,0.002241873,0.00002677203,0.00001566434,0.000005142552,0.0001149154,0.001095071,0.01793849,0.8774325,0.06157632,0.03948187],"study_design_scores_gemma":[0.0002283795,0.00006921062,0.003218991,0.0000177993,0.00002089834,0.00002109633,0.000008329602,0.7969233,0.01601088,0.1811616,0.002034398,0.0002850923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006770586,0.00002165084,0.9967925,0.0001804169,0.0003851744,0.0002283263,0.000005063681,0.0007816451,0.0009281606],"genre_scores_gemma":[0.03612763,2.706934e-7,0.9606123,0.0001242558,0.0001209168,0.000005853657,0.000003342176,0.00001368957,0.002991726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7958282,"threshold_uncertainty_score":0.9998391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02785267376776435,"score_gpt":0.3236458390263298,"score_spread":0.2957931652585654,"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."}}