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

IEEE Transactions on Information Theory

Volumn 58, Issue 12, 2012, Pages 7036-7044

  Matthews, William ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Block codes; channel coding; converse; finite blocklength; nonsignaling

Indexed keywords

CONVERSE; DISCRETE MEMORYLESS CHANNELS; ERROR PROBABILITIES; EXPLICIT FORMULATION; FINITE BLOCKLENGTH; LINEAR PROGRAMS; NONSIGNALING; OPTIMAL PERFORMANCE;

BLOCK CODES; CHANNEL CODING; COMPUTER APPLICATIONS; INFORMATION THEORY;

CHANNEL CAPACITY;

EID: 84869401081     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2210695     Document Type: Article

References (14)

1. Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
2. T. S. Cubitt, D. Leung,W.Matthews, and A.Winter, "Improving zeroerror classical communication with entanglement," Phys. Rev. Lett., vol. 104, no. 23, pp. 230503-1-230503-4, Jun. 2010.
3. T. S. Cubitt, D. Leung, W. Matthews, and A. Winter, "Zero-error channel capacity and simulation assisted by non-local correlations," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5509-5523, Aug. 2011.
4. S. Beigi, "Entanglement-Assisted zero-error capacity is upper-bounded by the Lovász function," Phys. Rev. A, vol. 82, no. 1, pp. 010303-1-010303-4, Jul. 2010.
5. R. Duan, S. Severini, and A. Winter, Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovász function 2010 [Online]. Available: http://arxiv.org/abs/1002.2514
6. D. Leung, L. Mancinska, W. Matthews, M. Ozols, and A. Roy, "Entanglement can increase asymptotic rates of zero-error classical communication over classical channels," Commun. Math. Phys., vol. 311, no. 1, pp. 97-111, 2012.
7. S. Verdú andT.S.Han, "Ageneral formula for channel capacity," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, Jul. 1994.
8. V. Strassen, "Asymptotische abschätzungen in Shannons informationstheorie," in Proc. Trans. Third Prague Conf. Inf. Theory, 1962, pp. 689-723.
9. J. von Neumann, "Zur theorie der gesellschaftsspiele," Mathematische Annalen, vol. 100, no. 1, pp. 295-320, 1928.
10. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
11. A. Charnes and W. W. Cooper, "Programming with linear fractional functionals," Naval Res. Logist. Quart., vol. 9, no. 3-4, pp. 181-186, 1962.
12. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
13. I. Csiszar, "The method of types [information theory]," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2505-2523, Oct. 1998.
14. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Oct. 1948.