2013/06/24 by Elisa Gorla, Gorla, Elisa, Alberto Ravagnani +1 · 1 citation
Computer Science · Mathematics · #11T71 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:11T71
paper · pdf · doi:10.48550/arxiv.1306.5609
arxiv created 2013/06/24 · arxiv updated 2013/06/25
Following the approach by R. Kötter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space Fqn, q being a prime power and Fq the finite field with q elements. In particular, following an idea in finite projective geometry, we introduce a class of network codes which we call "partial spread codes". Partial spread codes naturally generalize spread codes. In this paper we provide an easy description of such codes in terms of matrices, discuss their maximality, and provide an efficient decoding algorithm.