Dual-Domain Exponent of Maximum Mutual Information Decoding

2025/01/23 by Moeini, AmirPouya, Fàbregas, Albert Guillén i · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR)

paper · doi:10.48550/arxiv.2501.13724

Abstract

This paper provides a dual domain derivation of the error exponent of maximum mutual information (MMI) decoding with constant composition codes, showing it coincides with that of maximum likelihood decoding for discrete memoryless channels. The analysis is further extended to joint source-channel coding, demonstrating that the generalized MMI decoder achieves the same random coding error exponent as the maximum a posteriori decoder.

Cited by

• Class-Based Expurgation Attains Csiszár's Expurgated Source-Channel Exponent

Related

• The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code
• Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
• Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel
• Joint source-channel with side information coding error exponents
• Typical Error Exponents: A Dual Domain Derivation