Ranks of propelinear perfect binary codes

It is proven that for any numbers $n=2^m-1, m\geq 4$ and $r$, such that $n-\log(n+1)\leq r \leq n$ excluding $n=r=63$, $n=127$, $r\in\{126,127\}$ and $n=r=2047$ there exists a propelinear perfect binary code of length $n$ and rank $r$.