{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005102,0.0005077372,0.0007812678,0.0006204604,0.0004071054,0.0007290561,0.0008950091,0.0007761092,0.0006338768],"category_scores_gemma":[0.004375377,0.0002787229,0.0003188338,0.0005056151,0.0006906744,0.0009946622,0.0009001366,0.0006495385,0.0003893159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005658045,"about_ca_system_score_gemma":0.0007990985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001031079,"about_ca_topic_score_gemma":0.001198195,"domain_scores_codex":[0.9987968,0.000478124,0.00005318123,0.0001595792,0.0003936996,0.0001184274],"domain_scores_gemma":[0.9984496,0.0008759631,0.0001408156,0.0001966368,0.0003026401,0.00003433211],"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.0005806748,0.00007226945,0.001535957,0.0001665881,0.00007267536,0.0002422774,0.0002984154,0.6657153,0.03559136,0.08361525,0.001459671,0.2106495],"study_design_scores_gemma":[0.00002171242,0.00004506915,0.0001681575,0.000009705703,0.000009544911,0.00006902774,0.00001011353,0.9754454,0.01152262,0.01223867,0.0004473608,0.0000126613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05613909,0.0003195076,0.9401957,0.0001651181,0.00002499533,0.0000298504,0.00004644019,0.0003726741,0.002706623],"genre_scores_gemma":[0.6720567,0.0002487844,0.3253565,0.00009929407,0.00003488343,0.00006341882,0.0001075391,0.00006582262,0.001967027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001031079,"threshold_uncertainty_score":0.005315542,"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."}}