{"id":"W1576747764","doi":"10.1109/glocom.2002.1188418","title":"On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Quantization (signal processing); Computer science; Parity-check matrix; List decoding; Berlekamp–Welch algorithm; Mathematics; Block code; Error floor; Concatenated error correction code","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.0004785492,0.00013137,0.0001830731,0.0001193765,0.000112675,0.00005583032,0.0004467892,0.00005782162,0.00000996283],"category_scores_gemma":[0.0000538045,0.0001280322,0.00008846,0.0002048315,0.00002590972,0.0002659468,0.0001384127,0.00008540168,0.000006673037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001215294,"about_ca_system_score_gemma":0.00008015565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000636032,"about_ca_topic_score_gemma":0.0006624397,"domain_scores_codex":[0.9988618,0.00002842359,0.0002897241,0.0003422316,0.0002271239,0.0002506718],"domain_scores_gemma":[0.9990548,0.0001936727,0.0001507708,0.000386862,0.0001619709,0.00005186719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001586885,0.0003121667,0.002115946,0.00008985038,0.00004949919,0.000008511944,0.002228728,0.00009355214,0.01616233,0.2242296,0.002569758,0.7521242],"study_design_scores_gemma":[0.0006464345,0.0003803379,0.00178581,0.00006094817,0.000009535103,0.000007867708,0.0002052009,0.01752928,0.9341735,0.04490476,0.00006973522,0.0002266338],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1443881,0.000005987561,0.8540021,0.0002841317,0.0002147915,0.0003330757,0.00000423149,0.0003731994,0.0003943571],"genre_scores_gemma":[0.5110558,0.000002297075,0.488688,0.0001767633,0.00001833828,0.00001894253,0.00000297193,0.000006528317,0.00003040049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9180111,"threshold_uncertainty_score":0.5221002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02313879195692324,"score_gpt":0.3239858061072761,"score_spread":0.3008470141503528,"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."}}