A Linear Program for the Finite Block Length Converse of Polyanskiy-Poor-Verdu Via Non-Signalling Codes
Motivated by recent work on entanglement-assisted codes for sending messages over classical channels, the larger, easily characterized class of non-signaling codes is defined. Analyzing the optimal performance of these codes yields an alternative proof of the finite block length converse of Polyanskiy, Poor and Verdu, 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-signaling codes attain the channel capacity with zero error probability if and only if the dispersion of the channel is zero.