{"id":"W2123138508","doi":"10.1109/lcomm.2005.1461687","title":"Estimating the minimum distance of turbo-codes using double and triple impulse methods","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Algorithm; Dither; Computer science; Minimum distance; Turbo; Distance measurement; Decoding methods; Mathematics; Statistics; Telecommunications; Bandwidth (computing); Artificial intelligence","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.0009092244,0.0004216092,0.0004850871,0.001001991,0.0002711032,0.0006781772,0.0004743727,0.0005994141,0.000589165],"category_scores_gemma":[0.006775473,0.0002710404,0.0003351842,0.0004960787,0.0006204655,0.001500629,0.0009594036,0.0007965861,0.0003097482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003501784,"about_ca_system_score_gemma":0.0007602883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005473791,"about_ca_topic_score_gemma":0.0006800444,"domain_scores_codex":[0.9992908,0.0002101988,0.00003513954,0.00009382723,0.0003177323,0.00005230067],"domain_scores_gemma":[0.9974437,0.00162098,0.000268866,0.0002508472,0.0003338987,0.00008175768],"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.0007295997,0.0001173666,0.004125629,0.0002231091,0.0001047627,0.0001885168,0.0003980277,0.4206557,0.06878039,0.06300671,0.0007322014,0.440938],"study_design_scores_gemma":[0.00002254385,0.0001611046,0.0009764478,0.00002535088,0.00001599406,0.0002319311,0.00003620068,0.9441032,0.03846297,0.01497991,0.000934134,0.0000501803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05250531,0.0001952972,0.94624,0.00004752542,0.0000179503,0.0000103495,0.00001459937,0.0001615641,0.0008074002],"genre_scores_gemma":[0.4299129,0.0002512641,0.5684609,0.00002164162,0.00002523766,0.00003888228,0.00005129623,0.00005157023,0.001186376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001001991,"threshold_uncertainty_score":0.004808486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04260657935844516,"score_gpt":0.3528862874106217,"score_spread":0.3102797080521766,"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."}}