{"id":"W3136561982","doi":"10.1109/tit.2021.3138769","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Discrete mathematics; Markov process; Zero (linguistics); Coding (social sciences); Combinatorics; Algorithm; 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.002108648,0.0007016924,0.0007957887,0.0007291537,0.0004190267,0.001517968,0.001037804,0.0008998698,0.002206482],"category_scores_gemma":[0.01211891,0.0005015208,0.0004660513,0.0008209492,0.001745633,0.0022027,0.001131376,0.001627216,0.0003776523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00272948,"about_ca_system_score_gemma":0.002976921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003962639,"about_ca_topic_score_gemma":0.00269181,"domain_scores_codex":[0.9990951,0.0002729237,0.00004926916,0.0001616882,0.0002589024,0.0001621141],"domain_scores_gemma":[0.9914484,0.006853648,0.0005640722,0.0003320231,0.0006323255,0.0001695481],"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.0003058435,0.00004919222,0.0004896188,0.0001313425,0.00002275891,0.00006100053,0.0001238118,0.604573,0.003407434,0.3617988,0.001214681,0.02782254],"study_design_scores_gemma":[0.0000198179,0.00004400513,0.0001334148,0.00003512684,0.000006847354,0.0000272559,0.00002174029,0.8875501,0.002395754,0.1093325,0.0004163723,0.00001710976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1150671,0.001041797,0.8723827,0.001009574,0.00007054805,0.00006121177,0.0003261561,0.000183119,0.009857768],"genre_scores_gemma":[0.9162962,0.001317275,0.07560427,0.0002056421,0.00008573592,0.00009988581,0.0003619691,0.0001079438,0.00592094],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003962639,"threshold_uncertainty_score":0.01980382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01219420957808383,"score_gpt":0.2409598753792961,"score_spread":0.2287656658012122,"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."}}