Asymptotics of Noisy Constrained Channel Capacity

@article{Han2007AsymptoticsON,
  title={Asymptotics of Noisy Constrained Channel Capacity},
  author={Guangyue Han and Brian H. Marcus},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={991-995}
}
In this paper, we generalize a result by E. Ordentlich and T. Weissman. (2004) and derive an asymptotic formula for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a binary symmetric channel. And we prove an asymptotic formula for the capacity of a binary symmetric channel with input process supported on an irreducible finite type constraint. 

From This Paper

Topics from this paper.

References

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

An Introduction to Symbolic Dynamics and Coding

  • D. Lind, B. Marcus
  • 1995
Highly Influential
4 Excerpts

Capacity of Finite-State Machine Channels

  • P. Vontobel, A. Kavcic, D. Arnold, Hans-Andrea Loeliger
  • Submitted to IEEE Transactions on Information…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…