Skew Coding and Skew Factorisation

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Beukers, Prof.dr. Frits
dc.contributor.advisor	Kallen, Dr. Wilberd van der
dc.contributor.author	Lekic, N.
dc.date.accessioned	2011-11-07T18:01:05Z
dc.date.available	2011-11-07
dc.date.available	2011-11-07T18:01:05Z
dc.date.issued	2011
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/9407
dc.description.abstract	The thesis consists of two parts. First part is on coding theory, more specifically on skew codes. It starts with a short introduction to coding theory by presenting a few codes and giving bounds on their quality. It also includes an overview of papers by Boucher and Ulmer on cyclic codes over skew polynomial rings that motivated the thesis. The second part deals with factorisation in skew polynomial rings. We improve the estimate of the bound of a polynomial in skew rings given by Boucher and Ulmer and present a new approach to factorisation using difference operators.
dc.description.sponsorship	Utrecht University
dc.format.extent	345389 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.title	Skew Coding and Skew Factorisation
dc.type.content	Master Thesis
dc.rights.accessrights	Open Access
dc.subject.courseuu	Mathematical Sciences