On the Bhattacharyya Rate for BISOM Channels and Its Code Threshold

摘要：

In this paper, we study the properties of the Bhattacharyya noise parameter γ for binaryinput symmetric-output memoryless (BISOM) channels. A channel quality measure Bhattacharyya rate β(△=)1-γ is shown to be, for an arbitrary BISOM channel, between the cutoff rate R0 and the channel capacity C, i.e., R0 ≤β≤ C. Based on this relationship and the modified Shulman-Feder bound, a Bhattacharyya rate code threshold is proposed. We show that the derived code threshold is tighter than the corresponding threshold due to Jin and McEliece.

作者: Ruoheng Liu Predrag Spasojevi(c)

作者单位: WINLAB, Rutgers University North Brunswick, NJ 08902

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 224-228

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）