{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251727,0.0005092213,0.0005462796,0.0007137331,0.0004159815,0.0004931561,0.0007678578,0.0007053626,0.001793289],"category_scores_gemma":[0.002526102,0.0003202635,0.0005018918,0.0008043438,0.0005524855,0.0009838224,0.0006443076,0.001104955,0.0007165467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007048102,"about_ca_system_score_gemma":0.00115917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003139899,"about_ca_topic_score_gemma":0.003412529,"domain_scores_codex":[0.9996674,0.00009254602,0.00001247233,0.0000423276,0.0001666814,0.00001846303],"domain_scores_gemma":[0.9993145,0.0003830626,0.00005150224,0.00006688763,0.0001613876,0.00002263864],"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.00009177752,0.00006246662,0.0007935388,0.0001721538,0.00005519983,0.0001262471,0.0001903457,0.4865129,0.01838944,0.1441551,0.003570542,0.3458803],"study_design_scores_gemma":[0.000005992616,0.000009769034,0.00006299617,0.000005321187,0.000002682959,0.00003448013,0.000003414307,0.9905219,0.001304037,0.006002664,0.002038708,0.000008059087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001188502,0.0000567842,0.9982528,0.00003017086,0.00001421927,0.00001221846,0.00001503048,0.000107366,0.0003229031],"genre_scores_gemma":[0.05553695,0.0002519084,0.939575,0.00007297179,0.00003938207,0.0001459108,0.0001542853,0.0001340757,0.004089579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003139899,"threshold_uncertainty_score":0.006243289,"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."}}