A \(q\) -ary linear code with length \(n\) , dimension \(k\)  and minimum distance \(d\)  is denoted as an \([n,k,d]_q\) -linear code.
From the Singleton bound [1]}, we have the following inequality
\(d\le n-k+1.\) 
