{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169783,0.0004959135,0.0007768387,0.0004301555,0.0004530177,0.0005891655,0.0006667414,0.0006713251,0.000659339],"category_scores_gemma":[0.005004264,0.0003167801,0.0003966918,0.0008225093,0.001128908,0.001087258,0.00108126,0.000679183,0.0002901478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007934686,"about_ca_system_score_gemma":0.001119485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00201936,"about_ca_topic_score_gemma":0.001501468,"domain_scores_codex":[0.9990478,0.0003841655,0.00003456197,0.00007695344,0.0003449607,0.00011156],"domain_scores_gemma":[0.9970809,0.001725786,0.0002761548,0.0002683656,0.000561821,0.00008702533],"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.0001342585,0.00001940302,0.0006269081,0.0001072497,0.00002843897,0.0002032982,0.0001376028,0.8074977,0.00654542,0.1514768,0.0009263519,0.03229662],"study_design_scores_gemma":[0.000004539425,0.00002546204,0.00004727619,0.000005117518,0.000005076492,0.00005234544,0.000005893397,0.9858921,0.002114761,0.01146549,0.0003737842,0.000008131545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05374983,0.0005628339,0.9416994,0.0002062411,0.00004474084,0.0000324928,0.00005163355,0.0002356588,0.003417106],"genre_scores_gemma":[0.9016955,0.0004293674,0.09609104,0.00005051366,0.00003840723,0.00005699528,0.00007847854,0.00003036411,0.001529378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00201936,"threshold_uncertainty_score":0.006186485,"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."}}