Font-Segura, JosepMartínez, Alfonso, 1973-Guillén i Fábregas, A. (Albert)2024-01-302024-01-302019Font-Segura J, Martinez A, Guillén Fàbregas A. Asymptotics of the random coding error probability for constant-composition codes. In: 2019 IEEE International Symposium on Information Theory (ISIT);2019 Jul 7-12; Paris, France. [Piscataway]: IEEE;2019. p. 2947–51. DOI: 10.1109/ISIT.2019.884927497815386929122157-8095http://hdl.handle.net/10230/58877Comunicació presentada a 2019 IEEE International Symposium on Information Theory (ISIT), celebrada del 7 al 12 de juliol de 2019 a Paris, França.Saddlepoint approximations to the error probability are derived for multiple-cost-constrained random coding ensembles where codewords satisfy a set of constraints. Constantcomposition inputs over a binary symmetric channel are studied as a particular case. For codewords with equiprobable empirical distribution, the analysis recovers the same error exponent and pre-exponential polynomial decay as the uniform i.i.d. ensemble and provides an explicit formula for the loss in prefactor (thirdorder term) incurred by the constant-composition ensemble.application/pdfeng© 2019 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/ISIT.2019.8849274info:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1109/ISIT.2019.8849274LatticesError probabilityRandom variablesEncodingCost functionPairwise error probabilityFrequency modulationinfo:eu-repo/semantics/openAccess