论文标题
单个字母的上限与不匹配能力不匹配
A Single-Letter Upper Bound to the Mismatch Capacity
论文作者
论文摘要
我们为离散的无内存通道的单个字母上限绑定到不匹配的解码能力。结合表示为通道转换的共同信息，因此翻译的通道上的最大样本解码误差意味着原始通道中的不匹配编码误差。特别是，强烈的匡威证明可以在此上限上保持：如果速率超过上限，那么当块长度趋于无穷大时，误差的可能性趋于指数。我们还表明，潜在的优化问题是凸连接问题，而有效的迭代算法会收敛到最佳解决方案。此外，我们表明，与文献中可实现的速度不同，BOND的多重版本并不能改善。在整篇文章中讨论了许多示例。
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error on the translated channel implies a mismatched-decoding error in the original channel. In particular, a strong converse is shown to hold for this upper-bound: if the rate exceeds the upper-bound, the probability of error tends to 1 exponentially when the block-length tends to infinity. We also show that the underlying optimization problem is a convex-concave problem and that an efficient iterative algorithm converges to the optimal solution. In addition, we show that, unlike achievable rates in the literature, the multiletter version of the bound does not improve. A number of examples are discussed throughout the paper.
