Suppose I randomly generate a $k \times n$ matrix with $k < n$ over $\mathbb{Z}_q$. or Think of it as $k$ vectors over $\mathbb{Z}_q^n$. We then choose a $k$-sized subset of indices $S \subset \mathbb{Z}_n + 1$ and build a $k \times k$ matrix out of selected indices. Suppose $M(S)$ is a matrix built like that over indices $S$. You can choose any subset but the selected indices must be consistent across all vectors.
For example, is the original matrix is $A_{3 \times n}$ and $S = \{1,3,4\}$, The result is $M(S) = \begin{pmatrix}a_{11} & a_{13} &a_{14} \\ a_{21} & a_{23} &a_{24} \\ a_{31} & a_{33} &a_{34}\end{pmatrix}$
I need all such $k \times k$ matrices to be of full rank. That is $\forall S, S \subset \mathbb{Z}_n + 1$ , $|S| = k \to \rho (M(S)) = k$.
What is the probability that any random $k$ vectors have such property?