{"id":"W2152004013","doi":"10.1109/spawc.2005.1506272","title":"The factor graph EM algorithm: applications for LDPC codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Factor graph; Low-density parity-check code; Computer science; Algorithm; Decoding methods; Fading; Block code; Message passing; Tanner graph; Factor (programming language); Error floor; Coding (social sciences); Channel code; Theoretical computer science; Mathematics; 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.00132215,0.001372989,0.001020848,0.001370726,0.000596154,0.0008838944,0.001215875,0.002064591,0.004245141],"category_scores_gemma":[0.008611158,0.00058993,0.0005616321,0.002106466,0.001086006,0.00175035,0.001543934,0.001932409,0.002331939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007775656,"about_ca_system_score_gemma":0.0009534514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0022846,"about_ca_topic_score_gemma":0.002069421,"domain_scores_codex":[0.9993052,0.0003216359,0.00004015179,0.0001211461,0.0001757921,0.00003601944],"domain_scores_gemma":[0.9974003,0.001803159,0.0001360546,0.0002567614,0.0003513481,0.00005246904],"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.0001245254,0.00004987063,0.0005592572,0.0002614263,0.00006355762,0.0001961889,0.000170259,0.4222315,0.00400467,0.1604374,0.008766073,0.4031353],"study_design_scores_gemma":[0.00001941692,0.00001704529,0.00007760539,0.00003861106,0.000008144217,0.000152494,0.00001872873,0.851863,0.002485295,0.1348463,0.01044868,0.00002470203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000582693,0.0002937211,0.9976484,0.0001528869,0.00002642101,0.00001972242,0.00004268572,0.0003556193,0.0008778542],"genre_scores_gemma":[0.03186439,0.0009801117,0.9630968,0.0001699332,0.00007758629,0.0001471682,0.0002680496,0.0003029592,0.003092872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004245141,"threshold_uncertainty_score":0.0142014,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01885033883918836,"score_gpt":0.2906385783450119,"score_spread":0.2717882395058235,"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."}}