  Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in
random linear network coding. Here we give improved upper bounds for their
cardinalities based on the Johnson bound for constant dimension codes.
