Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Analysis And Constructions Of Subspace Codes, Carolyn E. Troha
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 …
Free Resolutions Associated To Representable Matroids, Nicholas D. Armenoff
Free Resolutions Associated To Representable Matroids, Nicholas D. Armenoff
Theses and Dissertations--Mathematics
As a matroid is naturally a simplicial complex, one can study its combinatorial properties via the associated Stanley-Reisner ideal and its corresponding free resolution. Using results by Johnsen and Verdure, we prove that a matroid is the dual to a perfect matroid design if and only if its corresponding Stanley-Reisner ideal has a pure free resolution, and, motivated by applications to their generalized Hamming weights, characterize free resolutions corresponding to the vector matroids of the parity check matrices of Reed-Solomon codes and certain BCH codes. Furthermore, using an inductive mapping cone argument, we construct a cellular resolution for the matroid …
Determinantal Ideals From Symmetrized Skew Tableaux, Bill Robinson
Determinantal Ideals From Symmetrized Skew Tableaux, Bill Robinson
Theses and Dissertations--Mathematics
We study a class of determinantal ideals called skew tableau ideals, which are generated by t x t minors in a subset of a symmetric matrix of indeterminates. The initial ideals have been studied in the 2 x 2 case by Corso, Nagel, Petrovic and Yuen. Using liaison techniques, we have extended their results to include the original determinantal ideals in the 2 x 2 case, as well as special cases of the ideals in the t x t case. In particular, for any skew tableau ideal of this form, we have defined an elementary biliaison between it and one …