{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002223383,0.0001850255,0.0002592681,0.0001079442,0.0001896445,0.0000363446,0.0007547679,0.00007133244,0.000004115751],"category_scores_gemma":[0.0001118079,0.0001831564,0.00006036839,0.0002228497,0.0002726727,0.0003758435,0.00008613698,0.0001801714,0.000001840791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003993414,"about_ca_system_score_gemma":0.00002102908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001103538,"about_ca_topic_score_gemma":0.0003504815,"domain_scores_codex":[0.9989869,0.00005049811,0.0004555901,0.0001737085,0.00009628423,0.000237002],"domain_scores_gemma":[0.997519,0.0005102959,0.0001537121,0.001537314,0.0002100628,0.00006957995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002713955,0.00164635,0.002698643,0.001096666,0.00133972,0.000001615465,0.01820787,0.02835063,0.03944156,0.2042422,0.08645293,0.6138079],"study_design_scores_gemma":[0.002031934,0.0005042956,0.003363905,0.0007943336,0.00007491004,0.00001162762,0.001124935,0.04300698,0.3020945,0.008509697,0.6371711,0.001311765],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1078255,0.01533015,0.8356118,0.01608861,0.00005449466,0.001862135,0.0006872109,0.001595391,0.0209447],"genre_scores_gemma":[0.8039809,0.004409111,0.1909782,0.0001000867,0.00001226432,0.0002193375,0.00007957431,0.00003722834,0.0001833201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6961554,"threshold_uncertainty_score":0.7468902,"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."}}