{"id":"W2164397492","doi":"10.1109/icc.2007.156","title":"Lowering Error Floor of LDPC Codes Using a Joint Row-Column Decoding Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; CMC Microsystems","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Algorithm; Joint (building); Factor graph; Computer science; Tanner graph; List decoding; Sequential decoding; Field-programmable gate array; Bit error rate; Error detection and correction; Parity bit; Error floor; Concatenated error correction code; Computer hardware; Block code; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.0009969928,0.0001841839,0.0002913991,0.0002718612,0.0001275394,0.0000690829,0.000795711,0.0001022875,0.00002134539],"category_scores_gemma":[0.0001739029,0.0001895945,0.0001473137,0.0007137464,0.00004896834,0.0004417285,0.0006907005,0.0001886202,0.00000616268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001861571,"about_ca_system_score_gemma":0.00009291418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005306414,"about_ca_topic_score_gemma":0.000214957,"domain_scores_codex":[0.9981937,0.00002520967,0.0005086774,0.0004322777,0.0003757653,0.000464339],"domain_scores_gemma":[0.9987683,0.00007110453,0.0002286983,0.000658811,0.0001635849,0.000109449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001082384,0.0002688844,0.007589127,0.0001436123,0.00005403928,0.00009505446,0.002149137,0.0004345006,0.5963801,0.004125485,0.00030988,0.3884394],"study_design_scores_gemma":[0.0001404202,0.00004709546,0.001949022,0.0001951231,0.00000697317,0.00006601841,0.00006233164,0.2955883,0.7005677,0.001083061,0.00003919818,0.0002547541],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2321098,0.00002391189,0.7640032,0.00003116404,0.0005870043,0.0001466945,6.048637e-7,0.0006224877,0.00247507],"genre_scores_gemma":[0.4648878,7.647238e-7,0.5349188,0.00006344281,0.00002977712,0.000001405885,7.987765e-8,0.00001220175,0.00008575798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3881847,"threshold_uncertainty_score":0.7731438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04978170627579082,"score_gpt":0.3129137856972331,"score_spread":0.2631320794214423,"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."}}