Abstract
The lossy source coding problem with feed-forward link was recently introduced in [1] and the corresponding rate-distortion function was derived in [2] and [3] for stationary and ergodic sources and for arbitrary sources with memory, respectively. The achievability schemes of [2] and [3] are mainly based on codetrees. In this work, we give an alternative proof of achievability for binary asymmetric Markov sources via a simple coding scheme that utilizes optimal lossy coding for Bernoulli sources. We then generalize this coding scheme for m-ary Markov sources and show its optimality for the distortion region where the Shannon lower bound is tight.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
