Partial Spreads in Random Network Coding
Following the approach by R. K?tter and F. R. Kschischang, the authors explain network codes as families of k-dimensional linear subspaces of a vector space Fnq, q being a prime power and Fq the finite field with q elements. In particular, following an idea in finite projective geometry, they introduce a class of network codes which they call partial spread codes. Partial spread codes naturally generalize spread codes. In this paper, they provide an easy description of such codes in terms of matrices, discuss their maximality, and provide an efficient decoding algorithm.