{"id":"W2102981938","doi":"10.1109/lcomm.2002.803481","title":"Bootstrap decoding of low-density parity-check codes","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Erasure; Computer science; Algorithm; Parity bit; List decoding; Sequential decoding; Mathematics; Arithmetic; Theoretical computer science; Concatenated error correction code; 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.0003977162,0.0001366735,0.0002018865,0.000168047,0.0002652386,0.00007398415,0.003469371,0.00006169228,0.000008728342],"category_scores_gemma":[0.00009561645,0.0001546928,0.00009931814,0.0004593736,0.0002283526,0.0003644763,0.0005272459,0.0003408035,0.00003986203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009375437,"about_ca_system_score_gemma":0.00001304108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001477444,"about_ca_topic_score_gemma":0.00009692862,"domain_scores_codex":[0.9987495,0.0002173176,0.0003505358,0.0002465644,0.0002068789,0.000229219],"domain_scores_gemma":[0.9956653,0.0004162203,0.0002097352,0.003541997,0.0001080577,0.00005873195],"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.000008526131,0.001275731,0.03476506,0.0001790977,0.0001892963,0.00002443957,0.0119939,0.0003669134,0.7257599,0.06090979,0.09195764,0.07256976],"study_design_scores_gemma":[0.0009709441,0.0001785129,0.01676004,0.0007532599,0.00008038493,0.0001624196,0.0002416469,0.4290693,0.5338026,0.004764206,0.01138726,0.001829515],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3955399,0.0003429895,0.5803512,0.0189899,0.0003360019,0.0002699309,0.000003715663,0.001015401,0.003150915],"genre_scores_gemma":[0.8233593,0.0001287654,0.175296,0.001148184,0.0000147041,0.00001777293,0.00000148146,0.00001005866,0.00002376743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4287023,"threshold_uncertainty_score":0.6447013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08314543522971805,"score_gpt":0.3042154743104801,"score_spread":0.221070039080762,"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."}}