A Refinement of Expurgation
IEEE Transactions on Information Theory（2023）
Abstract
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.
MoreTranslated text
Key words
refinement
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined