Partial spreads in random network coding

Following an idea in finite projective geometry, we introduce a class of subspace codes which we call partial spread codes. Partial spread codes naturally generalize spread codes. We provide an easy description of such codes in terms of block matrices, establish their maximality, and give an efficient decoding algorithm.