Linear programming bounds for balanced arrays

In this paper, we apply Delsarte's linear programming bound to balanced arrays, a key ingredient in certain constructions of fractional factorial designs. Examples are given to illustrate the power and generality of this technique compared with previous applications of the method of moments.