Superposition codes for mismatched decoding
Jonathan Scarlett, Alfonso García Martínez, Albert Guillén i Fàbregas · 2013
An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) decoding rule. The result is obtained using a refinement of the superposition coding ensemble. The rate is tight with respect to the ensemble average, and can be weakened to the LM rate of Hui and Csiszár-Körner, and to Lapidoth's rate based on parallel codebooks.