@inproceedings{574dfc31dbbe4ebf968063a540206055,
title = "Asymptotic Neyman-Pearson games for converse to the channel coding theorem",
abstract = "Upper bounds have recently been derived on the maximum volume of length-n codes for memoryless channels subject to either a maximum or an average decoding error probability ε. These bounds are expressed in terms of a minmax game whose variables are n-dimensional probability distributions and whose payoff function is the power of a Neyman-Pearson test at significance level 1 - ε. We derive the exact asymptotics (as n → ∞) of this game by relating it to a problem that admits an asymptotic saddlepoint with an equalizer property.",
author = "Pierre Moulin",
year = "2013",
doi = "10.1109/ISIT.2013.6620485",
language = "English (US)",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1541--1545",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",
address = "United States",
note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",
}