A Refinement of Expurgation
arXiv:2307.12162 · doi:10.1109/TIT.2024.3388563
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.