On the calculation of the minimax-converse of the channel coding problem
Elkayam, Nir; Feder, Meir;
Subject: Computer Science - Information Theory
A minimax-converse has been suggested for the general channel coding problem by Polyanskiy etal. This converse comes in two flavors. The first flavor is generally used for the analysis of the coding problem with non-vanishing error probability and provides an upper boun... View more
 Y. Polyanskiy, H. V. Poor, and S. Verdu´, “Channel coding rate in the finite blocklength regime,” Information Theory, IEEE Transactions on, vol. 56, no. 5, pp. 2307-2359, 2010.
 Y. Polyanskiy, “Saddle point in the minimax converse for channel coding,” Information Theory, IEEE Transactions on, vol. 59, no. 5, pp. 2576-2595, 2013.
 N. Elkayam and M. Feder, “Achievable and converse bounds over a general channel and general decoding metric,” arXiv preprint arXiv:1411.0319, 2014. [Online]. Available: http://www.eng.tau.ac.il/∼elkayam/FiniteBlockLen.pdf
 --. (2016) Variational formulas for the power of the binary hypothesis testing problem with applications. [Online]. Available: http://www.eng.tau.ac.il/∼elkayam/Binary ISIT.pdf
 K. Fan, “Minimax theorems,” Proceedings of the National Academy of Sciences of the United States of America, vol. 39, no. 1, p. 42, 1953.
 W. Matthews, “A linear program for the finite block length converse of polyanskiy-poor-verdu´ via nonsignaling codes,” Information Theory, IEEE Transactions on, vol. 58, no. 12, pp. 7036-7044, 2012.
 I. Csisza´r, “The method of types [information theory],” Information Theory, IEEE Transactions on, vol. 44, no. 6, pp. 2505-2523, 1998.
 I. Csisza´r and J. Ko¨rner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Cambridge University Press, 2011. [Online]. Available: http://books.google.co.il/books?id=2gsLkQlb8JAC