  We give an upper bound that relates the minimum weight of a nonzero
componentwise product of codewords from some given number of linear codes, with
the dimensions of these codes. Its shape is a direct generalization of the
classical Singleton bound.
