Partial spreads in random network coding

Elisa Gorla, Alberto Ravagnani

Research output: Contribution to journalArticleAcademicpeer-review

23 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)104-115
Number of pages12
JournalFinite Fields and their Applications
Publication statusPublished - Mar 2014
Externally publishedYes


  • Partial spread
  • Random network coding


Dive into the research topics of 'Partial spreads in random network coding'. Together they form a unique fingerprint.

Cite this