{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133809,0.001108693,0.0009259488,0.0006307214,0.0005633581,0.000998702,0.000935623,0.001155745,0.002531118],"category_scores_gemma":[0.003392897,0.0004581028,0.0006697378,0.0009981546,0.0009806416,0.001007131,0.001542117,0.002326879,0.001162154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005970345,"about_ca_system_score_gemma":0.00197312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001540249,"about_ca_topic_score_gemma":0.001994903,"domain_scores_codex":[0.9993488,0.0002210691,0.0000416357,0.00009992094,0.0002406606,0.00004794168],"domain_scores_gemma":[0.9990643,0.0004658533,0.00007316017,0.0001293919,0.0002326172,0.0000348039],"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.0001614661,0.0001131185,0.0004525207,0.0002322074,0.00006922619,0.000174243,0.000184091,0.5123538,0.01190253,0.06334094,0.005992045,0.4050238],"study_design_scores_gemma":[0.00001974316,0.00005047467,0.00004639261,0.00001445595,0.000005817103,0.00006695798,0.000009808037,0.9848837,0.003248219,0.009659881,0.00198201,0.00001250129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001282298,0.00006233821,0.9977174,0.0000560651,0.00001726598,0.00002465038,0.00001840073,0.0001699385,0.0006515511],"genre_scores_gemma":[0.05300067,0.0001697458,0.9441545,0.0001105693,0.00004428607,0.0002240942,0.0001832114,0.00007690443,0.002035958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002531118,"threshold_uncertainty_score":0.008467436,"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."}}