• DocumentCode
    2024534
  • Title

    Asymptotics of Noisy Constrained Channel Capacity

  • Author

    Guangyue Han ; Marcus, B.

  • Author_Institution
    Dept. of Math., British Columbia Univ., Vancouver, BC
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    991
  • Lastpage
    995
  • Abstract
    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.
  • Keywords
    Markov processes; channel capacity; entropy; noise; set theory; asymptotic formula; binary symmetric channel; entropy rate; hidden Markov chain; irreducible finite type constraint; noisy constrained channel capacity; set theory; Automata; Channel capacity; Entropy; Hidden Markov models; Intersymbol interference; Mathematics; Memoryless systems; Mutual information; Random processes; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557353
  • Filename
    4557353
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2024534