IEEE - Institute of Electrical and Electronics Engineers, Inc. - Asymptotic Neyman-Pearson games for converse to the channel coding theorem

2013 IEEE International Symposium on Information Theory (ISIT)

Author(s): Pierre Moulin
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 July 2013
Conference Location: Istanbul, Turkey
Conference Date: 7 July 2013
Page(s): 1,541 - 1,545
ISBN (Electronic): 978-1-4799-0446-4
ISSN (Electronic): 2157-8117
ISSN (Paper): 2157-8095
DOI: 10.1109/ISIT.2013.6620485
Regular:

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... View More

Advertisement