An extremal problem for integer sparse recovery

Motivated by the problem of integer sparse recovery we study the following question. Let $A$ be an $m \times d$ integer matrix whose entries are in absolute value at most $k$. How large can be $d=d(m,k)$ if all $m \times m$ submatrices of $A$ are non-degenerate? We obtain new upper and lower bounds on $d$ and answer a special case of the problem by Brass, Moser and Pach on covering $m$-dimensional $k \times \cdots\times k$ grid by linear subspaces