{"id":"W1987043386","doi":"10.1109/cwit.2013.6621594","title":"An achievability proof for the lossy coding of Markov sources with feed-forward","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Lossy compression; Ergodic theory; Markov chain; Source code; Markov process; Computer science; Algorithm; Shannon–Fano coding; Variable-length code; Theoretical computer science; Coding (social sciences); Binary number; Mathematics; Discrete mathematics; Decoding methods; Statistics; Arithmetic","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.004155652,0.003204576,0.001792036,0.001616287,0.001178305,0.002221104,0.002344506,0.002869964,0.004465723],"category_scores_gemma":[0.0170626,0.001388413,0.001799534,0.001935049,0.00330699,0.004181346,0.0056647,0.006991446,0.001101657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002253727,"about_ca_system_score_gemma":0.002462846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001128914,"about_ca_topic_score_gemma":0.0007787417,"domain_scores_codex":[0.9970909,0.0007497039,0.0001657744,0.0003156569,0.001264968,0.0004129371],"domain_scores_gemma":[0.9854748,0.01152851,0.0006457562,0.0009792815,0.001112495,0.0002591052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002380652,0.0001183055,0.0003048841,0.0007921017,0.0001827182,0.0005283935,0.0006855595,0.1633062,0.01351246,0.7712929,0.007900941,0.0411375],"study_design_scores_gemma":[0.0001048016,0.0001839383,0.0002016617,0.0002145916,0.0001166276,0.0006578568,0.00008010493,0.4473913,0.01324396,0.531029,0.006661506,0.0001147027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006110917,0.000858017,0.985422,0.0009558777,0.0001150236,0.00007131571,0.0002860425,0.0001923247,0.005988457],"genre_scores_gemma":[0.6643244,0.006220985,0.3158088,0.001940975,0.0009690861,0.000954323,0.001012951,0.0002660708,0.008502414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004465723,"threshold_uncertainty_score":0.02197742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01048880119577621,"score_gpt":0.2365397556451853,"score_spread":0.2260509544494091,"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."}}