Dual-Domain Exponent of Maximum Mutual Information Decoding

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Moeini, AmirPouya, Fàbregas, Albert Guillén i
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915407115321344
author Moeini, AmirPouya
Fàbregas, Albert Guillén i
author_facet Moeini, AmirPouya
Fàbregas, Albert Guillén i
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2501_13724
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Dual-Domain Exponent of Maximum Mutual Information Decoding
Moeini, AmirPouya
Fàbregas, Albert Guillén i
Information Theory
Probability
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.
title Dual-Domain Exponent of Maximum Mutual Information Decoding
topic Information Theory
Probability
url https://arxiv.org/abs/2501.13724