arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.3360math.PRcs.ITmath.IT
收藏

Asymptotics of input-constrained binary symmetric channel capacity

Guangyue Han, Brian Marcus

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑