For \(v,w\in \mathbb {F}_{q}^m\) , one says that \(v\)  covers \(w\)  if \(\textnormal {Supp}(w)\subseteq \textnormal {Supp}(v)\) . If \(v\)  covers \(w\)  we write \(w\preceq v\) . Let \(C\)  be a linear code over \(\mathbb {F}_{q}\) . An element \(v_{0}\in C\setminus \lbrace 0\rbrace \)  is called minimal if \(v\preceq v_{0}\)  and \(v\in C\setminus \lbrace 0\rbrace \)  imply \(v=\lambda v_{0}\)  for some \(\lambda \in \mathbb {F}_q^{\ast }\) . If every nonzero codeword of a code is a minimal codeword then the code is termed as a minimal code. Now we recall a result from [1]} regarding a sufficient condition for a linear code to be minimal.
