  We prove asymptotic upper bounds on the number of $d$-partitions (paving
matroids of fixed rank) and partial Steiner systems (sparse paving matroids of
fixed rank), using a mixture of entropy counting, sparse encoding, and the
probabilistic method.
