{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001129573,0.0001598283,0.0001680316,0.0001847939,0.0002568998,0.0001598293,0.000577167,0.00008069698,0.00001231652],"category_scores_gemma":[0.0002072542,0.0001500071,0.00009232427,0.0003081329,0.00004398323,0.0005234387,0.000197473,0.000132252,0.000006922231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001400694,"about_ca_system_score_gemma":0.00007296177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005403259,"about_ca_topic_score_gemma":0.00009704656,"domain_scores_codex":[0.9986167,0.00002431246,0.0003077784,0.0004366892,0.0001791214,0.0004353846],"domain_scores_gemma":[0.9985499,0.0006593413,0.0001123813,0.0003021857,0.0002863946,0.00008974262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005983051,0.0001977899,0.002295111,0.00006935166,0.000117255,0.00002138894,0.004380403,0.00004526204,0.1789734,0.4457963,0.006848149,0.3611959],"study_design_scores_gemma":[0.0003800768,0.0001906633,0.0004649312,0.00004629227,0.000005538526,0.00003440089,0.0001253801,0.7887765,0.1993875,0.007591369,0.002632791,0.000364509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004024508,0.00005108292,0.9906693,0.000301998,0.0006439755,0.0003736648,0.000003407444,0.001058155,0.002873897],"genre_scores_gemma":[0.3050806,0.000001577422,0.6936701,0.0004081081,0.0001231218,0.00003175485,0.000003298672,0.00001016735,0.0006712739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7887313,"threshold_uncertainty_score":0.611711,"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."}}