A dual-domain achievability of the typical error exponent
Mostra el registre complet Registre parcial de l'ítem
- 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:54Z
- dc.date.available 2023-02-13T07:17:54Z
- dc.date.issued 2021
- dc.description Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual.
- dc.description.abstract For random-coding ensembles with pairwise-independent codewords, we show that the probability that the exponent of a given code from the ensemble being smaller than an upper bound on the typical random-coding exponent is vanishingly small. This upper bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memoryless channels. Our result recovers these as special cases and remains valid for arbitrary alphabets and channel memory, as well as arbitrary ensembles with pairwise independent codewords.
- dc.description.sponsorship This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Secretary of Universities and Research (Government of Catalonia), 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. A dual-domain achievability of the typical error exponent. In: 2021 IEEE International Symposium on Information Theory (ISIT); 2021 Jul 12-20; Melbourne, Australia. [Piscataway]: IEEE; 2021. p. 930-3. DOI: 10.1109/ISIT45174.2021.9517808
- dc.identifier.doi http://dx.doi.org/10.1109/ISIT45174.2021.9517808
- dc.identifier.uri http://hdl.handle.net/10230/55730
- dc.language.iso eng
- dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
- dc.relation.ispartof 2021 IEEE International Symposium on Information Theory (ISIT); 2021 Jul 12-20; Melbourne, Australia. [Piscataway]: IEEE; 2021. p. 930-3.
- dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/801370
- dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/725411
- dc.rights © 2021 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/ISIT45174.2021.9517808
- dc.rights.accessRights info:eu-repo/semantics/openAccess
- dc.subject.keyword Upper bound
- dc.subject.keyword Binary codes
- dc.subject.keyword Encoding
- dc.subject.keyword Memoryless systems
- dc.subject.keyword Channel capacity
- dc.subject.keyword Channel coding
- dc.subject.keyword Linear codes
- dc.subject.keyword Probability
- dc.subject.keyword Random codes
- dc.title A dual-domain achievability of the typical error exponent
- dc.type info:eu-repo/semantics/conferenceObject
- dc.type.version info:eu-repo/semantics/acceptedVersion