TY - GEN
T1 - Asymptotic Neyman-Pearson games for converse to the channel coding theorem
AU - Moulin, Pierre
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84890385897&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890385897&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620485
DO - 10.1109/ISIT.2013.6620485
M3 - Conference contribution
AN - SCOPUS:84890385897
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1541
EP - 1545
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -