{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000208358,0.0000900365,0.00007340058,0.0000460722,0.0003659575,0.0001917512,0.001056556,0.00003749839,0.000004486553],"category_scores_gemma":[0.00002602342,0.00006059515,0.0000710158,0.0002373973,0.0000303256,0.0002053645,0.0001228532,0.00007599752,0.00003019335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002970038,"about_ca_system_score_gemma":0.00002770026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000119145,"about_ca_topic_score_gemma":0.0001623268,"domain_scores_codex":[0.9992397,0.00001825078,0.0001501132,0.0002427293,0.0001311078,0.0002180307],"domain_scores_gemma":[0.99883,0.0003543703,0.00005504703,0.0006049491,0.0001092907,0.00004639176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[4.63925e-7,0.00002077872,0.00003194718,0.000001565098,0.000005722365,5.173663e-8,0.0002015193,0.000003330151,0.0002012588,0.06632556,0.006395068,0.9268127],"study_design_scores_gemma":[0.0002107362,0.0001134368,0.0005355521,0.00000793212,0.000007648849,0.00001357396,0.0001625337,0.1663871,0.04869353,0.06554731,0.7179106,0.0004099772],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000177773,0.00008928379,0.9942111,0.001987217,0.00009279464,0.0005412879,0.000004544982,0.001122754,0.001773285],"genre_scores_gemma":[0.06387091,0.00002272738,0.9330341,0.0004448039,0.0001306862,0.0006543699,0.000001365271,0.00001033786,0.001830665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9264027,"threshold_uncertainty_score":0.2814687,"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."}}