{"id":"W2474459891","doi":"10.1007/bf03219805","title":"Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers","year":2005,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Dither; Minimum distance; Mathematics; Upper and lower bounds; Block (permutation group theory); Algorithm; Byte; Computer science; Discrete mathematics; Combinatorics; Telecommunications; Bandwidth (computing); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007246476,0.003120998,0.002304272,0.003738862,0.001695591,0.005556144,0.003440217,0.002558646,0.007203227],"category_scores_gemma":[0.05698703,0.001991851,0.0013666,0.002870966,0.003706032,0.009723837,0.007303155,0.006024749,0.002038485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00407888,"about_ca_system_score_gemma":0.001915576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008741786,"about_ca_topic_score_gemma":0.001185274,"domain_scores_codex":[0.9932525,0.001676411,0.0003055076,0.0007780844,0.003134505,0.0008530741],"domain_scores_gemma":[0.9467021,0.04225949,0.001831757,0.003797297,0.004664158,0.0007451467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001187042,0.0002178179,0.001810576,0.001493302,0.0002735739,0.0003923388,0.0008627191,0.4033623,0.01619316,0.4707514,0.006715632,0.09674015],"study_design_scores_gemma":[0.00008222961,0.0003321572,0.0008657628,0.0003914188,0.0001326897,0.0006398832,0.0001752454,0.6258212,0.01930889,0.3474554,0.004619159,0.0001758909],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03798927,0.007937429,0.9263337,0.00192557,0.0003312712,0.00007909866,0.0005961198,0.0005643374,0.02424334],"genre_scores_gemma":[0.7787635,0.008048836,0.1980233,0.001250203,0.001014149,0.0005641505,0.001079152,0.0006750426,0.01058152],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007246476,"threshold_uncertainty_score":0.03832352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02902863803830005,"score_gpt":0.3019571541993673,"score_spread":0.2729285161610673,"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."}}