Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Linear Program for the Finite Block Length Converse of Polyanskiy–Poor–Verdú Via Nonsignaling Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Matthews, W. ; Dept. of Pure Math. & Math. Phys., Univ. of Cambridge, Cambridge, UK

Motivated by recent work on entanglement-assisted codes for sending messages over classical channels, the larger, easily characterized class of nonsignaling codes is defined. Analyzing 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 nonsignaling codes attain the channel capacity with zero error probability if and only if the dispersion of the channel is zero.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 12 )