{"id":"W1986161523","doi":"10.1109/tit.2007.909092","title":"Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Exponent; Channel (broadcasting); Ergodic theory; Upper and lower bounds; Source code; Discrete mathematics; Coding (social sciences); Algorithm; Markov process; Computer science; Mathematics; Statistics; Pure mathematics; Telecommunications; Mathematical analysis","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.004573847,0.001297251,0.001095122,0.001227948,0.0006847346,0.001687302,0.001342589,0.00132929,0.002475601],"category_scores_gemma":[0.03518742,0.0005239999,0.0005151623,0.0009495075,0.002690054,0.003708084,0.002354609,0.002163711,0.0003060082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002683843,"about_ca_system_score_gemma":0.001689638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00279462,"about_ca_topic_score_gemma":0.001927933,"domain_scores_codex":[0.9983424,0.0004803715,0.00008379237,0.0001894307,0.0005597712,0.0003442463],"domain_scores_gemma":[0.9604203,0.03399714,0.002332237,0.001229339,0.001710906,0.0003101847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003071091,0.00007254964,0.002317462,0.0002213839,0.00007254742,0.0004787368,0.0005025951,0.7004753,0.005663559,0.2764726,0.001225666,0.01219052],"study_design_scores_gemma":[0.00001186192,0.00003748102,0.0003719064,0.00003959955,0.00001897811,0.00009092167,0.00005466156,0.9527339,0.001720522,0.04460933,0.0002819061,0.00002890798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3121656,0.002908893,0.6640074,0.002259206,0.0002325056,0.0001062853,0.0002994687,0.0003315193,0.0176892],"genre_scores_gemma":[0.9754781,0.001157594,0.01918483,0.0001661806,0.0001210836,0.00009735271,0.0001093002,0.00008377511,0.003601831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004573847,"threshold_uncertainty_score":0.02418911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01535775619537317,"score_gpt":0.2306905621262921,"score_spread":0.215332805930919,"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."}}