Lemma 2.2 
[1]}(Ashikhmin-Barg)
If the ratio of the minimum and the maximum (Hamming) weights of nonzero codewords in a linear code \(C\)  over \(\mathbb {F}_{q}\)  is larger than \(\frac{q-1}{q}\) , then \(C\)  is a minimal code.

