Year: 2024
Type: article
Abstract: 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.
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,495
Funders: Ministerio de Ciencia, Innovación y Universidades, Universitat Pompeu Fabra, European Commission, Ministerio de Economía y Competitividad, Ministerio de Ciencia e Innovación, Universitat Politècnica de Catalunya, European Research Council, Agencia Estatal de Investigación, H2020 European Research Council, HORIZON EUROPE European Research Council
OpenAlex ID: W4394896781