The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code

07/23/2020
by   Ran Tamir, et al.
0

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 random-coding 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 non-trivial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2020

Error Exponents in the Bee Identification Problem

We derive various error exponents in the bee identification problem unde...
research
11/28/2017

Expurgated Bounds for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the expurgation of ...
research
05/17/2020

Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes

Typical random codes (TRC) in a communication scenario of source coding ...
research
11/22/2022

Generalized Random Gilbert-Varshamov Codes: Typical Error Exponent and Concentration Properties

We find the exact typical error exponent of constant composition general...
research
07/25/2020

Universal Decoding for Asynchronous Slepian-Wolf Encoding

We consider the problem of (almost) lossless source coding of two correl...
research
02/06/2018

A Distance Between Channels: the average error of mismatched channels

Two channels are equivalent if their maximum likelihood (ML) decoders co...
research
05/07/2020

Universal Coding and Prediction on Martin-Löf Random Points

We perform an effectivization of classical results concerning universal ...

Please sign up or login with your details

Forgot password? Click here to reset