{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339074,0.0002395877,0.000242816,0.0001999145,0.00072798,0.0000389472,0.001110898,0.0000523143,0.00002589896],"category_scores_gemma":[0.0001159715,0.0002194833,0.0001315979,0.0006582322,0.0002176329,0.0002195665,0.00003466319,0.0007231848,0.00001046729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235092,"about_ca_system_score_gemma":0.00001684661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100604,"about_ca_topic_score_gemma":0.00009507057,"domain_scores_codex":[0.997969,0.0006914424,0.0007081703,0.0001830639,0.0001439293,0.0003044487],"domain_scores_gemma":[0.9958947,0.001668505,0.0001918609,0.002014962,0.0001590595,0.00007090038],"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.00003286197,0.0004940045,0.00007366957,0.00007582208,0.000216933,0.000002038556,0.006446633,0.7500396,0.06625824,0.00110254,0.00007803352,0.1751796],"study_design_scores_gemma":[0.0004766033,0.000065479,0.001160559,0.0002733235,0.00008458994,0.00002141825,0.001342275,0.7812158,0.2063158,0.0002967864,0.008203996,0.0005433711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037429,0.0006108306,0.9819455,0.0001072368,0.00009761699,0.0003551781,0.00007054552,0.000608165,0.00583063],"genre_scores_gemma":[0.5590156,0.0001207596,0.440703,0.00003483399,0.0000126768,0.00001694517,0.00001197671,0.00005322264,0.00003097867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5486413,"threshold_uncertainty_score":0.8950269,"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."}}