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.
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universitat Pompeu Fabra |
| Repositorio: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/70609 |
| Acceso en línea: | http://hdl.handle.net/10230/70609 http://dx.doi.org/10.1109/TIT.2024.3388563 |
| Access Level: | acceso abierto |
| Palabra clave: | Reliable communications Error exponents Expurgated error exponent Random code ensembles Random coding |
| Sumario: | 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. |
|---|