{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004050222,0.0001375557,0.00019192,0.00008131878,0.0002531797,0.00003267349,0.001112014,0.00004308928,0.00000334285],"category_scores_gemma":[0.00003183194,0.0001248714,0.00004617063,0.0002613936,0.0003481957,0.0002538494,0.0001888264,0.0002836115,0.000001163008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008231043,"about_ca_system_score_gemma":0.000008915078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003623206,"about_ca_topic_score_gemma":0.00003555215,"domain_scores_codex":[0.9991102,0.0001578257,0.0003831287,0.0001060915,0.00008404691,0.0001586621],"domain_scores_gemma":[0.9971334,0.0004536385,0.0001280058,0.002205564,0.00004681667,0.00003251788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000117464,0.00004849605,0.0002790087,0.00007269131,0.00007177106,1.605756e-7,0.002001691,0.2131414,0.6623626,0.001320367,0.0007030451,0.1199869],"study_design_scores_gemma":[0.0002383551,0.000004966935,0.0001098505,0.00008136359,0.0000278374,0.000007323557,0.00008836912,0.8577907,0.1360806,0.0002917569,0.005085051,0.0001938025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1566338,0.002959789,0.8366709,0.002615985,0.0000739477,0.0002887606,0.00000899941,0.0003213747,0.0004263792],"genre_scores_gemma":[0.5126722,0.0001717369,0.4869618,0.0001127023,0.00001589354,0.00003873437,0.000003700908,0.00001877875,0.000004433306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6446493,"threshold_uncertainty_score":0.5092109,"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."}}