GHWs of Codes Arising from Cartesian Product of Graphs.

The rth generalized Hamming weight of a linear [n, k] code C is the cardinality of the smallest support of any r-dimensional subcode of C. In this paper, we obtain the generalized Hamming weights of the binary linear codes whose parity check matrices are the incidence matrices of the Cartesian product of graphs. We also determine the rth generalized Hamming weights of their dual codes. [ABSTRACT FROM AUTHOR]