Achievable Rates and Error Exponents for a Class of Mismatched Compound Channels
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
https://doi.org/10.1109/tit.2025.3574460
https://doi.org/10.1109/tit.2025.3574460
Abstract
Description
This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and continuous-alphabet channels, we derive approximations of the worst-case achievable information rates and error exponents as a function of the radius of a small relative entropy ball centered at the decoding metric, allowing the characterization of the loss incurred due to imperfect channel estimation. We provide a number of examples including symmetric metrics and modulo-additive noise metrics for discrete systems, and nearest neighbor decoding for continuous-alphabet channels, where we derive the approximation when the channel admits arbitrary statistics and when it is assumed noise-additive with unknown finite second-order moment.
This work was supported in part by European Research Council under Grant 725411 and Grant 101142747 and in part by Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. The work of Francesc Molina was supported by the Margarita Salas Fellowship.
This work was supported in part by European Research Council under Grant 725411 and Grant 101142747 and in part by Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. The work of Francesc Molina was supported by the Margarita Salas Fellowship.