Physical Sciences and Mathematics Commons^™

Analysis And Constructions Of Subspace Codes, Carolyn E. Troha

Theses and Dissertations--Mathematics

Random network coding is the most effcient way to send data across a network, but it is very susceptible to errors and erasures. In 2008, Kotter and Kschischang introduced subspace codes as an algebraic approach to error correcting in random network coding. Since this paper, there has been much work in constructing large subspace codes, as well as exploring the properties of such codes. This dissertation explores properties of one particular construction and introduces a new construction for subspace codes. We begin by exploring properties of irreducible cyclic orbit codes, which were introduced in 2011 by Rosenthal et al. As …