Capacity-achieving Probability Measure in Communication Channels

摘要：

　　The capacity of a communication channel is the tightest upper bound on the amount of information that can be reliably transmitted in a unit time over the channel. Let us consider a scalar memoryless noisy channel defined as a conditional probability distribution p(y|x).

关键词： Communication channel capacity Optimization in measure space Probability measure Kullback-Leibler divergence Predictive distribution

作者: Satoshi Ito Shiro Ikeda

作者单位: Department of Mathematical Analysis and Statistical Inference (and Optimization-based Inference Research Group, Research Innovation Center) The Institute of Statistical Mathematics 10-3 Midoricho, Tachikawa, Tokyo 190-8562, Japan

会议类型: 国际会议

会议名称: 第8届国际最优化方法及应用大会

会议地点: 上海

会议语种:英文

页码: 98-98

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