Open Access
June 2009 Asymptotics of input-constrained binary symmetric channel capacity
Guangyue Han, Brian Marcus
Ann. Appl. Probab. 19(3): 1063-1091 (June 2009). DOI: 10.1214/08-AAP570


We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117–122], we derive an asymptotic formula (when the noise parameter is small) for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a BSC. Using this result, we establish an asymptotic formula for the capacity of a BSC with input process supported on an irreducible finite type constraint, as the noise parameter tends to zero.


Download Citation

Guangyue Han. Brian Marcus. "Asymptotics of input-constrained binary symmetric channel capacity." Ann. Appl. Probab. 19 (3) 1063 - 1091, June 2009.


Published: June 2009
First available in Project Euclid: 15 June 2009

zbMATH: 1167.94322
MathSciNet: MR2537199
Digital Object Identifier: 10.1214/08-AAP570

Primary: 60K99 , 94A15
Secondary: 60J10

Keywords: constrained capacity , Entropy , Hidden Markov chain

Rights: Copyright © 2009 Institute of Mathematical Statistics

Vol.19 • No. 3 • June 2009
Back to Top