{"id":"W2467251259","doi":"10.1109/tit.2017.2692215","title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Markov process; Aperiodic graph; Markov model; Mathematical optimization; Applied mathematics; Combinatorics; 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.001254281,0.0008103981,0.0008069724,0.0006677859,0.0005321903,0.001347176,0.001069219,0.000895439,0.001624915],"category_scores_gemma":[0.00683002,0.0004202053,0.000502106,0.0008943293,0.002159039,0.001752049,0.001342185,0.001427508,0.0002465549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002298748,"about_ca_system_score_gemma":0.00239982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006754401,"about_ca_topic_score_gemma":0.003671761,"domain_scores_codex":[0.9991667,0.0001951311,0.0000410811,0.0001864991,0.0002079235,0.0002025468],"domain_scores_gemma":[0.9950477,0.003566517,0.0006406781,0.0001916101,0.0004181025,0.0001354573],"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.0002311115,0.00003229217,0.0004200511,0.0001070629,0.00002183487,0.000138475,0.0001547683,0.7241728,0.003543552,0.2519065,0.0007581354,0.01851342],"study_design_scores_gemma":[0.00001750235,0.000030909,0.00007787585,0.00002247846,0.000008848393,0.00002539798,0.00002440577,0.9348795,0.001832881,0.06273808,0.0003238729,0.00001818525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1002722,0.0008365628,0.8908925,0.000675099,0.00007968827,0.00004151803,0.0001869924,0.0001538346,0.006861614],"genre_scores_gemma":[0.9597643,0.0007154806,0.03524195,0.00009073676,0.00006125701,0.00006194971,0.0001434032,0.00004076123,0.003880147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006754401,"threshold_uncertainty_score":0.01667863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01424160728089567,"score_gpt":0.2452975965840599,"score_spread":0.2310559893031642,"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."}}