{"id":"W2145004969","doi":"10.1109/twc.2006.1633359","title":"Joint source-channel turbo coding for binary Markov sources","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Turbo code; Algorithm; Decoding methods; Noisy-channel coding theorem; Turbo equalizer; Rayleigh fading; Additive white Gaussian noise; Interleaving; Encoder; Turbo; Markov chain; Markov process; Theoretical computer science; Fading; Channel (broadcasting); Telecommunications; Concatenated error correction code; Mathematics; Block code; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002264549,0.0003630654,0.0003681365,0.0004215754,0.0009659337,0.00008180165,0.001271767,0.000203293,0.00002699322],"category_scores_gemma":[0.000005972755,0.0004240531,0.0002597387,0.0004812675,0.0002716757,0.0003090292,0.000016509,0.000630839,0.00003318409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002342882,"about_ca_system_score_gemma":0.00003003679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000907497,"about_ca_topic_score_gemma":0.0001900622,"domain_scores_codex":[0.9983221,0.0001131254,0.0006510151,0.0002837938,0.0002022404,0.0004276755],"domain_scores_gemma":[0.9963357,0.0006025186,0.0001271265,0.00267892,0.0001567716,0.00009889332],"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.00006781127,0.001155264,0.00002104293,0.000274906,0.0002444945,0.000001260981,0.001089667,0.7792833,0.0815665,0.005768152,0.004453754,0.1260739],"study_design_scores_gemma":[0.0009537637,0.0001216982,0.0001444146,0.0003011485,0.0001048978,0.00001624821,0.0004487023,0.7112491,0.2652295,0.003372535,0.01700799,0.001049987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01511956,0.0006777002,0.9781802,0.0007299447,0.0002031785,0.0008007819,0.0001440377,0.002606676,0.001537983],"genre_scores_gemma":[0.9621286,0.001819641,0.03364936,0.00007642432,0.0000466201,0.001481878,0.00008814048,0.0001560243,0.0005532634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9470091,"threshold_uncertainty_score":0.9998211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02588107837721232,"score_gpt":0.2535813488546046,"score_spread":0.2277002704773923,"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."}}