Description:
Comunicació presentada a 2022 IEEE International Symposium on Information Theory (ISIT), celebrat del 26 de juny a l'1 de juliol de 2022 a Espoo, Finlàndia.
Abstract:
We derive a lower bound on the typical random-coding (TRC) exponent of pairwise-independent codeword ensembles used over a finite-state channel (FSC) at rates below capacity. Under some conditions, we also show that the probability of selecting a code from the ensemble with an error exponent larger than our lower bound tends to one as the codeword length tends to infinity. Our result, presented here for the FSC, also applies to compound channels.
