Kangarshahi, Ehsan AsadiGuillén i Fábregas, A. (Albert)2023-03-092023-03-092021Kangarshahi EA, Guillén i Fàbregas A. A sphere-packing exponent for mismatched decoding. In: 2021 IEEE International Symposium on Information Theory: proceedings; 2021 Jul 12-20; Melbourne, Australia. [Piscataway]: IEEE; 2021. p. 1136-41. DOI: 10.1109/ISIT45174.2021.9517837http://hdl.handle.net/10230/56122Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual.We derive a sphere-packing error exponent for mismatched decoding over discrete memoryless channels. We find a lower bound to the probability of error of mismatched decoding that decays exponentially for coding rates smaller than a new upper bound to the mismatch capacity. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity.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.9517837info:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1109/ISIT45174.2021.9517837Upper boundError probabilityEncodingDecodingMemoryless systemsCapacity planninginfo:eu-repo/semantics/openAccess