Lower bound on generalized Hamming weights in terms of a notion of well-behaving

A lower bound for generalized Hamming weights of linear codes is introduced by using the notion of well-behaving. A sufficient condition for t-th rank MDS codes is also given.