{"id":"W2098237535","doi":"10.1109/tcomm.2011.011811.090638","title":"Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Low-density parity-check code; List decoding; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; Linear programming; Concatenated error correction code; Computer science; Mathematics; Block code; Error floor","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.0004116682,0.0004924562,0.0006949158,0.0004771818,0.0003516301,0.0006714768,0.0007046218,0.0006586353,0.00192326],"category_scores_gemma":[0.001232587,0.0002703843,0.0004295648,0.0005027801,0.0004504751,0.0006617129,0.0007395215,0.001424527,0.0009346219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000530528,"about_ca_system_score_gemma":0.0007683046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233139,"about_ca_topic_score_gemma":0.001109422,"domain_scores_codex":[0.9995982,0.000112419,0.00001763467,0.00005374816,0.000186966,0.00003106682],"domain_scores_gemma":[0.9995276,0.0002717826,0.00002550104,0.00004110315,0.000117828,0.00001616784],"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.0001381431,0.00007097889,0.0004710685,0.0001540817,0.00004829753,0.0001154818,0.0001647299,0.5657615,0.01722945,0.08539354,0.001828721,0.328624],"study_design_scores_gemma":[0.0000141778,0.00002688409,0.00003610835,0.000006798327,0.000003896954,0.00004157143,0.000006085903,0.9872413,0.003424367,0.007629674,0.001561615,0.000007544485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002844925,0.0000506357,0.9960067,0.00002726922,0.000009221376,0.00001434871,0.00001181438,0.0001931093,0.0008420576],"genre_scores_gemma":[0.1051103,0.0001464146,0.8912451,0.00006372308,0.00001705301,0.0001596125,0.0001145382,0.0001156196,0.003027686],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00192326,"threshold_uncertainty_score":0.006433964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0926874537098621,"score_gpt":0.3199310397218236,"score_spread":0.2272435860119615,"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."}}