Real-Time Coding With Limited Lookahead

@article{Asnani2011RealTimeCW,
  title={Real-Time Coding With Limited Lookahead},
  author={Himanshu Asnani and Tsachy Weissman},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={59},
  pages={3582-3606}
}
A real-time coding system with lookahead consists of a memoryless source, a memoryless channel, an encoder, which encodes the source symbols sequentially with knowledge of future source symbols up to a fixed finite lookahead d , with or without feedback of the past channel output symbols and a decoder, which sequentially constructs the source symbols using the channel output. The objective is to minimize the expected per-symbol distortion. For a fixed finite lookahead d ≥ 1, we invoke the… CONTINUE READING
10 Citations
36 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Constrained Markov decision processes with compact state and action spaces: The average case,

  • M.K.J.-I. Nakagami, Y. Huang
  • Optimization, vol
  • 2000
Highly Influential
3 Excerpts

Probing capacity

  • H. H. Permuter H. Asnani, T. Weissman
  • IEEE Trans . Inf . Theory
  • 2010

Similar Papers

Loading similar papers…