The linear programming bound for binary linear codes

Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for d/sub min/ (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.<
>