On the generalized Hamming weights of product codes

The rth generalized Hamming weight of a linear code is the minimum support size of any r-dimensional subcode. It has been found useful in the studies of cryptography and trellis coding. The authors derive several results on expressing the generalized Hamming weights of a product code in terms of those of its component codes. They also formulate a general conjecture. >