Pierre Moulin. Asymptotic Neyman-Pearson games for converse to the channel coding theorem. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 1541-1545, IEEE, 2013. [doi]
@inproceedings{Moulin13-1,
title = {Asymptotic Neyman-Pearson games for converse to the channel coding theorem},
author = {Pierre Moulin},
year = {2013},
doi = {10.1109/ISIT.2013.6620485},
url = {http://dx.doi.org/10.1109/ISIT.2013.6620485},
researchr = {https://researchr.org/publication/Moulin13-1},
cites = {0},
citedby = {0},
pages = {1541-1545},
booktitle = {Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013},
publisher = {IEEE},
}