{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003669161,0.0002142672,0.0003593891,0.0001911473,0.0005803706,0.0005493877,0.0002216747,0.0001206913,0.000001273396],"category_scores_gemma":[0.000009436546,0.0001991456,0.00007323585,0.0002958354,0.0001188259,0.001255555,0.000009647308,0.0002182147,0.000001227962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004296134,"about_ca_system_score_gemma":0.00006070885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005126653,"about_ca_topic_score_gemma":0.00002727714,"domain_scores_codex":[0.9984971,0.00004261563,0.0004283848,0.000460608,0.0002995309,0.0002717233],"domain_scores_gemma":[0.9991899,0.0001179571,0.0001870002,0.0002031512,0.0001600638,0.0001419247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008708642,0.0001688247,0.0003693749,0.000327393,0.00003216363,0.00000849725,0.001177802,0.001223918,0.005698779,0.0006507957,0.00002236947,0.9903114],"study_design_scores_gemma":[0.001079684,0.0009298497,0.0006093488,0.002973538,0.0001103658,0.0008243618,0.0009162373,0.9128941,0.07452788,0.003164636,0.0005533156,0.001416681],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1529476,0.0006519302,0.8451205,0.00004786127,0.00007828302,0.0001279166,0.00000771888,0.0002305072,0.0007877036],"genre_scores_gemma":[0.9991521,0.00002400851,0.000542123,0.00004223277,0.00004657631,0.000008830338,8.836195e-7,0.00001387046,0.0001694375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9888947,"threshold_uncertainty_score":0.8120922,"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."}}