{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668724,0.0001868321,0.0001791204,0.0002766773,0.0008712969,0.00008306644,0.002386027,0.00006806704,0.00001217965],"category_scores_gemma":[0.00002018063,0.0002052738,0.0001829369,0.0003938397,0.0001187338,0.0003721421,0.00001591682,0.0003637925,0.0000243393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000937577,"about_ca_system_score_gemma":0.0001113469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001230541,"about_ca_topic_score_gemma":0.0001294419,"domain_scores_codex":[0.9987143,0.0001358832,0.0003343866,0.0003434231,0.0001623212,0.0003096769],"domain_scores_gemma":[0.9963444,0.000620005,0.0001265722,0.002572052,0.0002373218,0.00009966236],"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.000006865154,0.0006715671,0.000008508891,0.00001217556,0.00003742443,0.00000123737,0.0007874762,0.0001422308,0.0003298516,0.002234098,0.0001359222,0.9956326],"study_design_scores_gemma":[0.0002910258,0.0002275945,0.00001133981,0.00007236798,0.00003617418,0.00001471222,0.00004355031,0.8914764,0.1002913,0.00184619,0.005392406,0.0002969241],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001291994,0.00004640335,0.9960086,0.0004736674,0.0003172158,0.0006421472,0.00002919567,0.001527907,0.0008256841],"genre_scores_gemma":[0.3267887,0.00002821788,0.6723531,0.0001379273,0.00001059549,0.0005806315,0.000004810427,0.00002171782,0.00007429087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9953357,"threshold_uncertainty_score":0.8370823,"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."}}