Typical random coding exponent for finite-state channels

Full item page Simple item page

  • dc.contributor.author Cocco, Giuseppe
  • dc.contributor.author Guillén i Fábregas, A. (Albert)
  • dc.contributor.author Font Segura, Josep
  • dc.date.accessioned 2023-02-13T07:17:49Z
  • dc.date.available 2023-02-13T07:17:49Z
  • dc.date.issued 2022
  • dc.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.
  • dc.description.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.
  • dc.description.sponsorship This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Catalan Secretary of Universities ´ and Research, by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 801370, and by the European Research Council under ERC grant agreement 725411.
  • dc.format.mimetype application/pdf
  • dc.identifier.citation Cocco 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.9834674
  • dc.identifier.doi http://dx.doi.org/10.1109/ISIT50566.2022.9834674
  • dc.identifier.issn 2157-8095
  • dc.identifier.uri http://hdl.handle.net/10230/55729
  • dc.language.iso eng
  • dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
  • dc.relation.ispartof 2022 IEEE International Symposium on Information Theory (ISIT); 2022 Jun 26-Jul 1; Espoo, Finland. [Piscataway]: IEEE; 2022. p. 3210-4.
  • dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/801370
  • dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/725411
  • dc.rights © 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.9834674
  • dc.rights.accessRights info:eu-repo/semantics/openAccess
  • dc.subject.keyword Codes
  • dc.subject.keyword Encoding
  • dc.subject.keyword Power capacitors
  • dc.subject.keyword Compounds
  • dc.subject.keyword Probability
  • dc.subject.keyword Random codes
  • dc.title Typical random coding exponent for finite-state channels
  • dc.type info:eu-repo/semantics/conferenceObject
  • dc.type.version info:eu-repo/semantics/acceptedVersion