{"id":"W2167038527","doi":"10.1109/lcomm.2004.827438","title":"Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Binary number; Sequential decoding; Theoretical computer science; Mathematics; Concatenated error correction code; Error floor; Block code; Arithmetic","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.000715094,0.0001899129,0.0002866288,0.0002389342,0.0003978968,0.0001331796,0.003513196,0.00005722456,0.000001917522],"category_scores_gemma":[0.0002188791,0.0002042639,0.0001341946,0.0004345732,0.0002739944,0.0006119181,0.0008188952,0.0004028645,0.00002542471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002087105,"about_ca_system_score_gemma":0.00006427933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001801588,"about_ca_topic_score_gemma":0.00007730753,"domain_scores_codex":[0.9983361,0.000241532,0.0004747859,0.0003730278,0.0003218114,0.0002527261],"domain_scores_gemma":[0.9948061,0.0005263067,0.0002912788,0.004062725,0.000240848,0.00007273087],"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.00004085869,0.0008677876,0.004290004,0.00008174706,0.0001582855,0.00004957688,0.009489023,0.003260421,0.8636025,0.05930114,0.01453553,0.04432309],"study_design_scores_gemma":[0.0007871339,0.0001090672,0.005821093,0.0008537107,0.00003419043,0.0001055552,0.00008562134,0.0173396,0.9424487,0.03053397,0.001185534,0.0006958435],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4067875,0.00008421648,0.5872189,0.005095429,0.0001716018,0.0001657173,0.000003512569,0.0003210427,0.0001520106],"genre_scores_gemma":[0.6018265,0.0000537054,0.3972572,0.0008092163,0.00001334453,0.000018352,0.000004432257,0.0000105583,0.000006602736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.195039,"threshold_uncertainty_score":0.8329639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03425367630716927,"score_gpt":0.293368421581066,"score_spread":0.2591147452738968,"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."}}