{"id":"W2165839667","doi":"10.1109/tcsii.2005.850742","title":"Soft-bit decoding of regular low-density parity-check codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Belief propagation; Parity bit; Low-density parity-check code; Algorithm; Sequential decoding; List decoding; Berlekamp–Welch algorithm; Computer science; Parity (physics); Bit (key); Point (geometry); Mathematics; Arithmetic; Concatenated error correction code; Error floor; Physics; Block 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985815,0.0004829395,0.0004364051,0.0005701401,0.0003440519,0.001038609,0.0008024042,0.0007322127,0.001420496],"category_scores_gemma":[0.004952044,0.0002049459,0.000276135,0.0006558173,0.000755199,0.0009369101,0.0006483411,0.0008740787,0.0007835504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005903161,"about_ca_system_score_gemma":0.0007846046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114492,"about_ca_topic_score_gemma":0.001234921,"domain_scores_codex":[0.9993579,0.0001568257,0.000030615,0.00006137202,0.0003333646,0.00006003611],"domain_scores_gemma":[0.9987252,0.0006153978,0.0001258413,0.0002159008,0.0002875408,0.00003011358],"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.0003564098,0.0000771859,0.0008125069,0.0002432539,0.00005932118,0.0003606083,0.0002071072,0.4621623,0.04618509,0.2590169,0.002703513,0.2278157],"study_design_scores_gemma":[0.00001005694,0.00003349139,0.0001110873,0.00001398603,0.00000701513,0.0001052426,0.000008367857,0.9578627,0.01128779,0.02944716,0.001100298,0.00001279092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02350502,0.0001969251,0.9722811,0.0001660615,0.00006202318,0.0000251825,0.00007225433,0.0003280625,0.003363487],"genre_scores_gemma":[0.6108482,0.000507096,0.3824825,0.0001529131,0.00007920009,0.00009375779,0.0002407135,0.00009635575,0.005499298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001420496,"threshold_uncertainty_score":0.00475204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0208737323771183,"score_gpt":0.24056303855863,"score_spread":0.2196893061815118,"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."}}