Almost affine codes and matroids

dc.contributor.advisor	Johnsen, Trygve
dc.contributor.author	Diachkov, Konstantin
dc.date.accessioned	2017-08-17T08:47:17Z
dc.date.available	2017-08-17T08:47:17Z
dc.date.issued	2017-05-15
dc.description.abstract	In this thesis we study various types of block codes, like linear, mutlti-linear, almost affine codes. We also look at how these codes can be described by associated matroids. In addition we look at flags (chains) of codes and see how their behavior can be described using demi-matroids. We also introduce weight polynomials for almost affine codes.	en_US
dc.identifier.uri	https://hdl.handle.net/10037/11301
dc.language.iso	eng	en_US
dc.publisher	UiT Norges arktiske universitet	en_US
dc.publisher	UiT The Arctic University of Norway	en_US
dc.rights.accessRights	openAccess	en_US
dc.rights.holder	Copyright 2017 The Author(s)
dc.rights.uri	https://creativecommons.org/licenses/by-nc-sa/3.0	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)	en_US
dc.subject.courseID	MAT-3900
dc.subject	Mathematics	en_US
dc.subject	Error-correcting codes	en_US
dc.subject	Almost affine codes	en_US
dc.subject	Matroids	en_US
dc.subject	VDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Algebra/algebraisk analyse: 414	en_US
dc.subject	VDP::Mathematics and natural science: 400::Mathematics: 410::Algebra/algebraic analysis: 414	en_US
dc.title	Almost affine codes and matroids	en_US
dc.type	Master thesis	en_US
dc.type	Mastergradsoppgave	en_US

Med mindre det står noe annet, er denne innførselens lisens beskrevet som Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)