Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Wei et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: