A dual-domain achievability of the typical error exponent

Simple item page
dc.contributor.authorCocco, Giuseppe
dc.contributor.authorGuillén i Fábregas, A. (Albert)
dc.contributor.authorFont Segura, Josep
dc.date.accessioned2023-02-13T07:17:54Z
dc.date.available2023-02-13T07:17:54Z
dc.date.issued2021
dc.descriptionComunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual.
dc.description.abstractFor 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.sponsorshipThis 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.mimetypeapplication/pdf
dc.identifier.citationCocco 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.doihttp://dx.doi.org/10.1109/ISIT45174.2021.9517808
dc.identifier.urihttp://hdl.handle.net/10230/55730
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof2021 IEEE International Symposium on Information Theory (ISIT); 2021 Jul 12-20; Melbourne, Australia. [Piscataway]: IEEE; 2021. p. 930-3.
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/801370
dc.relation.projectIDinfo: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.accessRightsinfo:eu-repo/semantics/openAccess
dc.subject.keywordUpper bound
dc.subject.keywordBinary codes
dc.subject.keywordEncoding
dc.subject.keywordMemoryless systems
dc.subject.keywordChannel capacity
dc.subject.keywordChannel coding
dc.subject.keywordLinear codes
dc.subject.keywordProbability
dc.subject.keywordRandom codes
dc.titleA dual-domain achievability of the typical error exponent
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.type.versioninfo:eu-repo/semantics/acceptedVersion

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Cocco_isi_dual.pdf
Size:
236.89 KB
Format:
Adobe Portable Document Format
Download

Collections