
Error Exponents in the Bee Identification Problem
We derive various error exponents in the bee identification problem unde...
read it

Expurgated Bounds for the Asymmetric Broadcast Channel
This work contains two main contributions concerning the expurgation of ...
read it

Universal Coding and Prediction on MartinLöf Random Points
We perform an effectivization of classical results concerning universal ...
read it

A Distance Between Channels: the average error of mismatched channels
Two channels are equivalent if their maximum likelihood (ML) decoders co...
read it

Universal Decoding for Asynchronous SlepianWolf Encoding
We consider the problem of (almost) lossless source coding of two correl...
read it

Optimal Achievable Rates for Computation With Random Homologous Codes
Building on the framework of nested coset codes by Padakandla and Pradha...
read it

On More General Distributions of Random Binning for SlepianWolf Encoding
Traditionally, ensembles of SlepianWolf (SW) codes are defined such tha...
read it
The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code
We provide two results concerning the optimality of the maximum mutual information (MMI) decoder. First, we prove that the error exponents of the typical random codes under the optimal maximum likelihood (ML) decoder and the MMI decoder are equal. As a corollary to this result, we also show that the error exponents of the expurgated codes under the ML and the MMI decoders are equal. These results strengthen the well known result due to Csiszár and Körner, according to which, these decoders achieve equal random coding error exponents, since the error exponents of the typical random code and the expurgated code are strictly higher than the random coding error exponents, at least at low coding rates. While the universal optimality of the MMI decoder, in the randomcoding error exponent sense, is easily proven by commuting the expectation over the channel noise and the expectation over the ensemble, when it comes to typical and expurgated exponents, this commutation can no longer be carried out. Therefore, the proof of the universal optimality of the MMI decoder must be completely different and it turns out to be highly nontrivial.
READ FULL TEXT
Comments
There are no comments yet.