Open Access. Powered by Scholars. Published by Universities.®

Algebra Commons

Open Access. Powered by Scholars. Published by Universities.®

University of Kentucky

Algebraic coding theory

Articles 1 - 2 of 2

Full-Text Articles in Algebra

Properties Of Skew-Polynomial Rings And Skew-Cyclic Codes, Kathryn Hechtel Jan 2024

Properties Of Skew-Polynomial Rings And Skew-Cyclic Codes, Kathryn Hechtel

Theses and Dissertations--Mathematics

A skew-polynomial ring is a polynomial ring over a field, with one indeterminate x, where one must apply an automorphism to commute coefficients with x. It was first introduced by Ore in 1933 and since the 1980s has been used to study skew-cyclic codes. In this thesis, we present some properties of skew-polynomial rings and some new constructions of skew-cyclic codes. The dimension of a skew-cyclic code depends on the degree of its generating skew polynomial. However, due to the skew-multiplication rule, the degree of a skew polynomial can be smaller than its number of roots and hence tricky to …


Analysis And Constructions Of Subspace Codes, Carolyn E. Troha Jan 2015

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 …