{"id":"W2103061764","doi":"10.1109/pacrim.2007.4313293","title":"Improved Iterative Bit Flipping Decoding Algorithms for LDPC Convolutional Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Convolutional code; Computer science; Coding gain; Sequential decoding; Serial concatenated convolutional codes; Bit error rate; Berlekamp–Welch algorithm; Concatenated error correction code; Coding (social sciences); Error detection and correction; List decoding; Parity bit; Error floor; Mathematics; 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.0006939169,0.0008720301,0.0006444219,0.001014954,0.0003439424,0.0006313975,0.001156986,0.0009670666,0.001417162],"category_scores_gemma":[0.00276506,0.0003017132,0.0004865408,0.001254305,0.0004513657,0.001101601,0.000585874,0.00134868,0.0008900295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005829234,"about_ca_system_score_gemma":0.0008413683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001881147,"about_ca_topic_score_gemma":0.0021329,"domain_scores_codex":[0.9993224,0.000137156,0.00004449576,0.00006498491,0.0003774974,0.00005344794],"domain_scores_gemma":[0.9988573,0.0003677424,0.0000932989,0.0002058004,0.0004466315,0.00002924527],"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.000221852,0.00007978973,0.0009292897,0.0002305822,0.00007552208,0.0001459658,0.0001654065,0.2546546,0.06834301,0.05481951,0.004309597,0.6160249],"study_design_scores_gemma":[0.00003940213,0.0000784099,0.0004216181,0.00002713632,0.0000230306,0.0002717015,0.000006968558,0.9356235,0.04119375,0.01298171,0.009284547,0.00004840784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007915593,0.000394257,0.9893828,0.00005610879,0.00003617933,0.000041572,0.00006452751,0.0005682932,0.001540744],"genre_scores_gemma":[0.09628815,0.0008762675,0.8985135,0.00009247764,0.00006378867,0.0001591614,0.000390406,0.0001315644,0.003484674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001881147,"threshold_uncertainty_score":0.004740894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03855092747249914,"score_gpt":0.3239399459391314,"score_spread":0.2853890184666322,"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."}}