Linear hashing in the Boolean cube with clusters of limited size

It is shown that for an arbitrary $M$-element subset of the Boolean $n$-cube there exists a linear hash function with clusters consisting of at most $a$ elements and with a rank at most $2\log_2 M-2\log_2 a+\mathcal O(1)$.