New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities 论文

摘要

With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.