{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367585,0.0005414824,0.0004514845,0.0004945335,0.000337481,0.0006052479,0.0004619871,0.0004933192,0.0009763099],"category_scores_gemma":[0.001844733,0.0002318707,0.0002303007,0.0004779422,0.0003997148,0.0006649573,0.0006039575,0.0005479935,0.0004480407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003564092,"about_ca_system_score_gemma":0.0009202881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001714527,"about_ca_topic_score_gemma":0.00258948,"domain_scores_codex":[0.999421,0.0001221852,0.00003420598,0.00007300505,0.0003021004,0.00004751934],"domain_scores_gemma":[0.9990454,0.0003911071,0.0000864051,0.0001850163,0.0002559981,0.00003595067],"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.0004266175,0.0001482755,0.002166621,0.0001470856,0.00007684964,0.0001897172,0.0001424559,0.4419591,0.151903,0.02552666,0.002349535,0.3749642],"study_design_scores_gemma":[0.00002042055,0.00005134117,0.0003068461,0.000006529763,0.0000147361,0.00009448644,0.000005519669,0.9473865,0.04922022,0.001980229,0.0009022238,0.00001097931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06684545,0.0001903085,0.9291737,0.0001264543,0.00002951709,0.0000296541,0.00006345877,0.001492117,0.00204942],"genre_scores_gemma":[0.513642,0.0001525682,0.4827839,0.00006087701,0.00002286112,0.00006593242,0.0001678145,0.0001138222,0.002990226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001714527,"threshold_uncertainty_score":0.003409088,"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."}}