Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
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 Csiszar-Korner-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.
Emre Telatar, Yunus Inan, Reka Inovan