Abstract:
We consider random matrix consisting of $n$ independent rows such that each row is equiprobably chosen from the set of all $m$-dimensional ($m>n$) binary vectors with given weights $s_i$, $i=1,\ldots,n$, and study asymptotic properties of the rank of such matrix.
We propose explicit upper bound for the distribution function of the rank of matrixes.
Key words:random matrix over $GF(2)$, distribution of the rank of random matrix, upper bound.