A q-ary linear code is an [n,k,d]q code, which is a linear code of length n, dimension k and minimum weight d over Fq, the field of order q. A fundamental problem in coding theory is to find nq(k,d), the minimum length n for which an [n,k,d]q code exists for given k,d and q. We introduce a new notion "e-locally 2-weight (mod q)" for linear codes over Fq and we give a necessary condition for the property. As an application, we prove the non-existence of some [n,4,d]9 codes with d ≡ −1 (mod 9), which determines n9(4,d) for some d.