A dual of well-behaving type designed minimum distance

We propose a lower bound for the minimum distance of [n,k] linear codes which are specified by generator matrices whose rows are k vectors of a given sequence of n linearly independent vectors over a finite field. It is noted that the Feng-Rao and the order bounds give lower bounds for the minimum distance of the dual codes.