Counting Steiner triple systems with classical parameters and prescribed rank

We note that this work provides the first two infinite families of 2-designs for which one has non-trivial lower and upper bounds for the number of non-isomorphic examples with a prescribed p-rank in almost the entire range of possible ranks.