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

DOI10.1109/TIT.2012.2210695zbMath1364.90209arXiv1109.5417OpenAlexW2024830741WikidataQ62109092 ScholiaQ62109092MaRDI QIDQ2989664

William Matthews

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.5417

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (2)

Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy

This page was built for publication: A Linear Program for the Finite Block Length Converse of Polyanskiy–Poor–Verdú Via Nonsignaling Codes