arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.5417quant-ph
收藏

基于非信令码的有限块长Polyanskiy-Poor-Verdú逆的线性规划

A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes

William Matthews

摘要:

最近的工作的动机纠缠辅助代码发送消息在经典的渠道,更大的,容易表征类的非信令代码的定义。分析这些代码的最佳性能产生了Polyanskiy,Poor和Verdú的有限块长度逆的另一种证明,并表明它们实现了这一逆。这提供了一个明确的制定逆作为一个线性规划,其中有一些有用的功能。对于离散无记忆信道,它表明,非信令码达到零错误概率的信道容量当且仅当分散的信道是零。

英文摘要:

Motivated by recent work on entanglement-assisted codes for sending messages over classical channels, the larger, easily characterised class of non-signalling codes is defined. Analysing the optimal performance of these codes yields an alternative proof of the finite block length converse of Polyanskiy, Poor and Verdú, and shows that they achieve this converse. This provides an explicit formulation of the converse as a linear program which has some useful features. For discrete memoryless channels, it is shown that non-signalling codes attain the channel capacity with zero error probability if and only if the dispersion of the channel is zero.

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

↑