The maximum number of pairwise disjoint recovery sets that can recover any given d-dimensional subspace from the columns of the generator matrix of a simplex code is determined.
