Simulation-based computation of information rates: upper and lower bounds

@article{Arnold2003SimulationbasedCO,
  title={Simulation-based computation of information rates: upper and lower bounds},
  author={Dieter Arnold and Aleksandar Kavcic and Hans-Andrea Loeliger and Pascal O. Vontobel and Wei Zeng},
  journal={IEEE International Symposium on Information Theory, 2003. Proceedings.},
  year={2003},
  pages={119-}
}
It has recently become feasible to compute information rates of finite-state source/channel models with memory. Such methods can also be used to compute upper and lower bounds on the information rate of very general (nonfinite-state) channels with memory by means of finite-state approximations. Further numerical bounds are obtained from reduced-state computations. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

Simulation-based estimation of the capacity of full-surface channels

  • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
  • 2005
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Secrecy through Synchronization Errors

  • 2015 IEEE Global Communications Conference (GLOBECOM)
  • 2014
VIEW 2 EXCERPTS
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES