Cocco, GiuseppeGuillén i Fábregas, A. (Albert)Font Segura, Josep2023-02-132023-02-132022Cocco G, Guillen i Fàbregas A, Font-Segura J. Typical random coding exponent for finite-state channels. In: 2022 IEEE International Symposium on Information Theory (ISIT); 2022 Jun 26-Jul 1; Espoo, Finland. [Piscataway]: IEEE; 2022. p. 3210-4. DOI: 10.1109/ISIT50566.2022.98346742157-8095http://hdl.handle.net/10230/55729Comunicació 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.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.application/pdfeng© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. http://dx.doi.org/10.1109/ISIT50566.2022.9834674info:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1109/ISIT50566.2022.9834674CodesEncodingPower capacitorsCompoundsProbabilityRandom codesinfo:eu-repo/semantics/openAccess