This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszár-Körner-Hui rate, thus providing a counter-example to a previously reported converse result. Both numerical evaluations and theoretical results are used in establishing this claim.

This work was supported in part by the European Union Seventh Framework Programme under Grant 303633, in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03, and in part by the Israel Science Foundation under Grant 2013/919.