{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132065,0.0002187838,0.0002111007,0.0004456283,0.0003672485,0.0001067907,0.0003253589,0.0001406416,0.00002268616],"category_scores_gemma":[0.00000862407,0.0002123909,0.00009510679,0.0002209999,0.00008935232,0.001104067,0.000003068185,0.0003421066,0.0000328157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002422697,"about_ca_system_score_gemma":0.00001865658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002300801,"about_ca_topic_score_gemma":0.00002470521,"domain_scores_codex":[0.9986804,0.00008719429,0.0006259188,0.0000944655,0.000241354,0.0002707157],"domain_scores_gemma":[0.9984835,0.0003235971,0.0001602398,0.0007753712,0.0001605612,0.00009672794],"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.0007360777,0.0001317236,0.000001669478,0.0007414545,0.000301173,5.686438e-7,0.02183907,0.8831595,0.001339912,0.0197863,0.001058565,0.070904],"study_design_scores_gemma":[0.00316525,0.000423278,0.000112535,0.001237783,0.0001784369,0.00007022719,0.0325723,0.7601312,0.1816183,0.001887853,0.01698858,0.001614166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005635049,0.00007552306,0.9878343,0.00009116829,0.0002431116,0.0009872514,0.00005904524,0.00116628,0.003908318],"genre_scores_gemma":[0.9942197,0.000102534,0.004834957,0.0001043479,0.00001881043,0.0004832115,0.0000647532,0.00004503215,0.0001267075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9885846,"threshold_uncertainty_score":0.866105,"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."}}