Cocco, GiuseppeGuillén i Fábregas, A. (Albert)Font Segura, Josep2023-02-132023-02-132021Cocco 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.9517808http://hdl.handle.net/10230/55730Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual.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.application/pdfeng© 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.9517808info:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1109/ISIT45174.2021.9517808Upper boundBinary codesEncodingMemoryless systemsChannel capacityChannel codingLinear codesProbabilityRandom codesinfo:eu-repo/semantics/openAccess