Repositorio Digital de la UPF
Publicación
Artículo científico (JournalArticle)
A refinement of expurgation
We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent., This work was supported in part by the Ramón y Cajal Fellowship Program funded by Spanish Government through the Ministerio de Ciencia, Innovación y Universidades (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 and European Union “NextGenerationEU” Recovery Plan under Grant RYC2021-033908-I, in part by European Research Council under ERC Grant Agreement 725441 and Agreement 101142747, and in part by Spanish Ministry of Economy and Competitiveness under Grant
PID2020-116683GB-C22.
Proyecto:
EC / HE 101142747
,
ES / 2PE PID2020-116683GB-C22