Add to ORKGAn 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. © 2013 IEEE
Abstract—This paper considers channel coding for the dis-crete memoryless multiple-access channel wi...
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The...
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric...
Abstract—An achievable rate is given for discrete memoryless channels with a given (possibly subopti...
This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal)...
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An...
This paper studies multiuser random coding techniques for channel coding with a given (possibly subo...
This paper studies multiuser random coding techniques for channel coding with a given (possibly subo...
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An...
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (...
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (...
Abstract—This paper studies channel coding for discrete memoryless channels with a given (possibly s...
This paper considers channel coding for the discrete memoryless multiple-access channel with a given...
This paper considers channel coding for the memoryless multiple-access channel with a given (possibl...
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless ch...
Abstract—This paper considers channel coding for the dis-crete memoryless multiple-access channel wi...
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The...
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric...
Abstract—An achievable rate is given for discrete memoryless channels with a given (possibly subopti...
This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal)...
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An...
This paper studies multiuser random coding techniques for channel coding with a given (possibly subo...
This paper studies multiuser random coding techniques for channel coding with a given (possibly subo...
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An...
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (...
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (...
Abstract—This paper studies channel coding for discrete memoryless channels with a given (possibly s...
This paper considers channel coding for the discrete memoryless multiple-access channel with a given...
This paper considers channel coding for the memoryless multiple-access channel with a given (possibl...
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless ch...
Abstract—This paper considers channel coding for the dis-crete memoryless multiple-access channel wi...
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The...
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric...