{"id":"W3098702051","doi":"","title":"4 The ADMM penalized decoder for LDPC codes∗","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Computer science; Forward error correction; Decoding methods; Algorithm; Turbo code; Theoretical computer science; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914588,0.0006389566,0.0006123944,0.0003961326,0.0003966434,0.0008790013,0.0008056966,0.001321663,0.002776163],"category_scores_gemma":[0.003395013,0.0003152565,0.0004448489,0.0005869754,0.0008326906,0.0007149701,0.0007900214,0.001316207,0.0006079617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001042743,"about_ca_system_score_gemma":0.001829526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003709416,"about_ca_topic_score_gemma":0.003233152,"domain_scores_codex":[0.9994031,0.0002697675,0.00002456026,0.00007373127,0.0001854166,0.00004340892],"domain_scores_gemma":[0.999008,0.0005071556,0.00008306437,0.0001185206,0.0002526908,0.00003065864],"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.0000633231,0.00001691915,0.0002011211,0.00004917051,0.0000163542,0.00004473428,0.00002027968,0.9519235,0.001489311,0.02782773,0.001540354,0.01680717],"study_design_scores_gemma":[0.000007167849,0.00001474811,0.00002857964,0.000004828668,0.000001777983,0.00001256564,0.000002114942,0.9923868,0.001045701,0.005718546,0.0007735654,0.000003578813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01208871,0.0002047796,0.9801194,0.0003957212,0.00005871813,0.00005477476,0.0002104864,0.0003531127,0.006514168],"genre_scores_gemma":[0.3435393,0.000245396,0.644348,0.0003175214,0.00004700059,0.0002183823,0.0006397279,0.0001441804,0.0105005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003709416,"threshold_uncertainty_score":0.009287238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01409845574576276,"score_gpt":0.2815434562247819,"score_spread":0.2674450004790192,"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."}}