Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
Hieta-aho, Erik Accepted Dissertation 5-1-18 Sp 18[9460].pdf (631.01 KB)
ETD Abstract Container
Abstract Header
On Finite Rings, Algebras, and Error-Correcting Codes
Author Info
Hieta-aho, Erik
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1525182104493243
Abstract Details
Year and Degree
2018, Doctor of Philosophy (PhD), Ohio University, Mathematics (Arts and Sciences).
Abstract
This dissertation entails four different topics related to coding theory. While much effort has gone recently into studying codes over ring alphabets (rather than the traditional field alphabets), we change this perspective slightly and focus not necessarily on the algebraic structure of the alphabet but in the ancillary structure of the ambient (the algebraically enhanced environment from which codes are drawn.) Doing so, we determine, for example, that when the ambient is a Frobenius algebra a version of the MacWilliams identities holds between the weight distribution of the appropriate codes and their properly defined duals. We further the consideration of rational power series and sequential codes, which had mostly been studied over field alphabets, to the case when the alphabet is a commutative local ring with nilpotent radical. Perhaps the most striking feature of our study is the introduction of a modified division algorithm that is based not on the degree of polynomials but on their codegree (degree of the lowest degree non-zero term.) As was the case in the initial papers on the subject, we explore criteria to recognize the Kronecker Criterion as well as multivariable rational functions among arbitrary multivariable power series with coefficients in a commutative local ring with nilpotent radical. The duals of sequential codes are the so-called polycyclic codes. We have studied intrinsic notions of duality based on the codegree of polynomials with sights to have a fully intrinsic perspective while studying codes in such ambients. We continue the ongoing explorations to recognize commutative local finite rings. Our study considers the feasibility of extending results in the literature for rings with 16 elements to rings with p
4
elements (p an arbitrary prime.)
Committee
Sergio Lopez-Permouth (Advisor)
Alexei Davydov (Committee Member)
Adam Fuller (Committee Member)
Jeffery Dill (Committee Member)
Pages
106 p.
Subject Headings
Mathematics
Keywords
error correcting codes
;
Frobenius algebras
;
finite rings
;
skew cyclic codes
;
ambient algebra
;
local rings
;
polynomials over finite rings
;
non degenerate bilinear form
;
rational functions
;
power series
;
sequential codes
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Hieta-aho, E. (2018).
On Finite Rings, Algebras, and Error-Correcting Codes
[Doctoral dissertation, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1525182104493243
APA Style (7th edition)
Hieta-aho, Erik.
On Finite Rings, Algebras, and Error-Correcting Codes.
2018. Ohio University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1525182104493243.
MLA Style (8th edition)
Hieta-aho, Erik. "On Finite Rings, Algebras, and Error-Correcting Codes." Doctoral dissertation, Ohio University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1525182104493243
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
ohiou1525182104493243
Download Count:
746
Copyright Info
© 2018, all rights reserved.
This open access ETD is published by Ohio University and OhioLINK.