Asymptotic Neyman-Pearson games for converse to the channel coding theorem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1541-1545
Number of pages5
DOIs
StatePublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Asymptotic Neyman-Pearson games for converse to the channel coding theorem'. Together they form a unique fingerprint.

Cite this