{"id":"W2145949855","doi":"10.1109/icc.2011.5962811","title":"Near Optimum Majority-Logic Based Decoding of Low-Density Parity-Check Codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Decoding methods; Parity-check matrix; Algorithm; Belief propagation; Berlekamp–Welch algorithm; List decoding; Computer science; Sequential decoding; Computation; Reliability (semiconductor); Parity bit; Block code; Measure (data warehouse); Computational complexity theory; Mathematics; Theoretical computer science; Concatenated error correction 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.0008828425,0.0001845943,0.000291755,0.0001187735,0.0001551051,0.00007724146,0.001209642,0.0001218266,0.0000903008],"category_scores_gemma":[0.0001908533,0.0001700933,0.0001140508,0.0004182407,0.0001258899,0.0003632015,0.0004457363,0.0002301871,0.00003957867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004685062,"about_ca_system_score_gemma":0.000104973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007518405,"about_ca_topic_score_gemma":0.0001435248,"domain_scores_codex":[0.9984492,0.0001232335,0.0003365583,0.0004623018,0.0002869566,0.0003417229],"domain_scores_gemma":[0.9984081,0.0001770967,0.0001700218,0.0009262259,0.0002123096,0.0001062191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001994085,0.002842261,0.4127039,0.0007186899,0.0001656673,0.0003526559,0.01126133,0.0003310365,0.05155364,0.4673065,0.00980092,0.042764],"study_design_scores_gemma":[0.0003746188,0.0003466419,0.01630105,0.0001189159,0.00001723195,0.00002432227,0.00006755325,0.3411155,0.6172401,0.02370578,0.000109585,0.0005786679],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1808024,0.000017688,0.8011689,0.000129732,0.0002508845,0.0001625517,8.587226e-7,0.001086166,0.01638086],"genre_scores_gemma":[0.5383533,0.00000185911,0.4613458,0.0002186453,0.000008701166,0.000004217049,4.489708e-7,0.000006409071,0.00006061165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5656865,"threshold_uncertainty_score":0.6936206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04596375382161072,"score_gpt":0.266575264689824,"score_spread":0.2206115108682133,"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."}}