{"id":"W1973580796","doi":"10.1002/ett.1185","title":"Estimating the minimum distance of large‐block turbo codes using iterative multiple‐impulse methods","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Algorithm; Computer science; Dither; Turbo; Impulse (physics); Minimum distance; Turbo equalizer; Concatenated error correction code; Block code; Mathematics; Decoding methods; Mathematical optimization; Telecommunications","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.001060101,0.0004590219,0.0004784849,0.0009546526,0.0002961566,0.0004761833,0.0005695066,0.0005804874,0.0006583924],"category_scores_gemma":[0.006849617,0.0003480751,0.0003098589,0.0005062198,0.0005492603,0.001197963,0.0007319347,0.0007554344,0.0003237956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004591757,"about_ca_system_score_gemma":0.0008015488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009180991,"about_ca_topic_score_gemma":0.0008840616,"domain_scores_codex":[0.9994963,0.000198311,0.00002685929,0.00006282396,0.0001857531,0.0000299824],"domain_scores_gemma":[0.9959944,0.002669429,0.000579752,0.0002686063,0.000409028,0.00007874298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003044991,0.00006498896,0.003417257,0.0001767454,0.00007634472,0.00014705,0.000264504,0.8064579,0.04538208,0.02307987,0.00048705,0.1201416],"study_design_scores_gemma":[0.00001273424,0.00005592932,0.0008813172,0.00001470071,0.000006219236,0.00009529461,0.00001751527,0.9742655,0.01864436,0.005583145,0.0003952725,0.00002808754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09343831,0.0002028832,0.9052437,0.00006228451,0.00001340557,0.00001400162,0.00002109568,0.0002429077,0.0007615089],"genre_scores_gemma":[0.6057048,0.0001528346,0.3931105,0.00001827334,0.00001324702,0.00003330714,0.00007537843,0.00006249724,0.0008290957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001060101,"threshold_uncertainty_score":0.005606413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02834000237277867,"score_gpt":0.3383813975324715,"score_spread":0.3100413951596928,"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."}}