{"id":"W2045663703","doi":"10.1109/ita.2008.4601015","title":"Optimal causal quantization of Markov Sources with distortion constraints","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Randomness; Encoder; Mathematics; Markov process; Quantization (signal processing); Markov chain; Asymptotically optimal algorithm; Mathematical optimization; Rate–distortion theory; Convex optimization; Algorithm; Regular polygon; Data compression; Statistics","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.0000477223,0.00006603493,0.00009423865,0.00005670413,0.00003188155,0.000004298089,0.00009498775,0.00004021907,0.00008689276],"category_scores_gemma":[0.000006102164,0.00006036125,0.00001553243,0.0001015594,0.0001573497,0.000103401,0.00001396132,0.00006064195,0.000003290179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002118022,"about_ca_system_score_gemma":0.00001113368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002921092,"about_ca_topic_score_gemma":0.00002221248,"domain_scores_codex":[0.9996017,0.00001473851,0.0001488216,0.00005742614,0.0001059548,0.0000713899],"domain_scores_gemma":[0.999678,0.00002167389,0.00003275838,0.0001944859,0.00005044026,0.00002263623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003353697,0.001095369,0.4007032,0.001112576,0.0007905501,0.00006695232,0.03687999,0.1745828,0.2161197,0.08783471,0.01949196,0.06098688],"study_design_scores_gemma":[0.001379772,0.0003691022,0.1750811,0.0002400627,0.00005344649,0.0002652092,0.001157849,0.1705505,0.6455104,0.000151987,0.004111156,0.001129448],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7471987,0.00004878333,0.2473209,0.00001618065,0.00001113271,0.00006880698,0.00000265524,0.0003959757,0.004936877],"genre_scores_gemma":[0.9714048,0.0001113089,0.02839987,0.000005181461,0.000005171937,0.000008075298,0.00001544018,0.00001359169,0.00003658145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4293907,"threshold_uncertainty_score":0.246146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0131169949613724,"score_gpt":0.2163972265873615,"score_spread":0.2032802316259891,"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."}}