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

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]

Authors

Pierre Moulin

This author has not been identified. Look up 'Pierre Moulin' in Google