A Refinement of Expurgation

07/22/2023

∙

by   Giuseppe Cocco, et al.

∙

0

∙

share

We show that with probability that tends to 1 with the code length, expurgating an arbitrarily small fraction of codewords from most pairwise independent codebooks will result in a code attaining the expurgated exponent. We connect the result with the typical error exponent.