{"id":"W2118552966","doi":"10.1109/tit.2010.2053873","title":"Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Low-density parity-check code; Turbo code; Mathematics; Upper and lower bounds; Concatenated error correction code; Bounding overwatch; Discrete mathematics; Combinatorics; Algorithm; Block code; Computer science; Decoding methods","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.0008260721,0.0001430556,0.0001282187,0.0001879456,0.0006881603,0.000321054,0.0003287994,0.0001046901,0.00003659692],"category_scores_gemma":[0.00007021258,0.000145843,0.00007109044,0.0001769002,0.0001616059,0.002000271,0.000004697532,0.0003366178,0.00004098444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004621418,"about_ca_system_score_gemma":0.00009847003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005746782,"about_ca_topic_score_gemma":0.000008503689,"domain_scores_codex":[0.9990192,0.0000459767,0.0003313361,0.0001702218,0.0002147698,0.0002184991],"domain_scores_gemma":[0.9988748,0.0004299983,0.0001460725,0.0002870469,0.0001818303,0.00008021151],"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.0002649341,0.0001534414,0.00004438061,0.0001993621,0.00007524101,0.000001137051,0.009091695,0.001432475,0.02964229,0.5822588,0.0006675667,0.3761687],"study_design_scores_gemma":[0.001750479,0.0004036402,0.0002510921,0.0002454514,0.00004920406,0.0002053688,0.0004302931,0.7593385,0.1449952,0.07299992,0.01817601,0.00115492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01372435,0.0000086384,0.9828479,0.0002656994,0.0005528981,0.0002808985,0.00002847699,0.0005950726,0.00169602],"genre_scores_gemma":[0.927257,0.000003846376,0.07192735,0.0004627207,0.00002953723,0.0001250047,0.000005505545,0.000008450349,0.0001805805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9135327,"threshold_uncertainty_score":0.5947305,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006618558313170579,"score_gpt":0.232299132713384,"score_spread":0.2256805744002134,"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."}}