An achievability proof for the lossy coding of Markov sources with feed-forward

@article{Asoodeh2013AnAP,
  title={An achievability proof for the lossy coding of Markov sources with feed-forward},
  author={Shahab Asoodeh and Fady Alajaji and Tam{\'a}s Linder},
  journal={2013 13th Canadian Workshop on Information Theory},
  year={2013},
  pages={66-70}
}
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… CONTINUE READING

References

Publications referenced by this paper.