{"id":"W2765645554","doi":"10.1109/lcomm.2017.2766223","title":"An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Low-density parity-check code; Linear programming; Decoding methods; Polytope; Mathematics; Projection (relational algebra); Computer science; Computational complexity theory; Euclidean distance; Combinatorics; Artificial intelligence","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.0006143754,0.0001511377,0.0002002749,0.0001982867,0.000985397,0.0003280997,0.004370917,0.00006435013,9.940924e-7],"category_scores_gemma":[0.000135432,0.0001610675,0.00009744933,0.0001554953,0.0002389553,0.0009611892,0.0002475712,0.0001989132,0.000002252512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009692147,"about_ca_system_score_gemma":0.00008961122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002741363,"about_ca_topic_score_gemma":0.0001447964,"domain_scores_codex":[0.9988345,0.0001868786,0.000306941,0.0003058474,0.0001550931,0.0002107341],"domain_scores_gemma":[0.9943449,0.0003129859,0.0004742843,0.004563514,0.0002523774,0.0000519625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002137603,0.0005987305,0.002924293,0.00006398315,0.00008946387,0.000002300691,0.006846345,0.0002288017,0.480059,0.00382582,0.005162007,0.5001779],"study_design_scores_gemma":[0.0003459733,0.0001663487,0.0009855008,0.0001214952,0.00001714666,0.000005194819,0.00007859216,0.7482224,0.2484769,0.0003583341,0.0009644075,0.000257789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02584063,0.0000288532,0.9665866,0.006072044,0.0002929965,0.0005473614,0.00001715958,0.0003501515,0.0002642075],"genre_scores_gemma":[0.4939035,0.00000530807,0.5054613,0.0004063433,0.00003669804,0.0001555854,0.000009207516,0.00001125761,0.00001082767],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7479935,"threshold_uncertainty_score":0.8122324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0692624273249454,"score_gpt":0.3708577463820699,"score_spread":0.3015953190571244,"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."}}