Let $k\ge2$. The maximum number of $0$-$1$ (column) vectors of length $2k-1$ which makes a rank $k$ matrix with no zero row nor two identical rows is $2^{k-1}+1$. (The rank is over the rationals.)

I have a computer-based proof for this statement, but I'm looking for a computer-free argument.