Show simple item record

dc.contributor.advisorJohnsen, Trygve
dc.contributor.authorDiachkov, Konstantin
dc.date.accessioned2017-08-17T08:47:17Z
dc.date.available2017-08-17T08:47:17Z
dc.date.issued2017-05-15
dc.description.abstractIn 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.urihttps://hdl.handle.net/10037/11301
dc.language.isoengen_US
dc.publisherUiT Norges arktiske universiteten_US
dc.publisherUiT The Arctic University of Norwayen_US
dc.rights.accessRightsopenAccessen_US
dc.rights.holderCopyright 2017 The Author(s)
dc.subject.courseIDMAT-3900
dc.subjectMathematicsen_US
dc.subjectError-correcting codesen_US
dc.subjectAlmost affine codesen_US
dc.subjectMatroidsen_US
dc.subjectVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Algebra/algebraisk analyse: 414en_US
dc.subjectVDP::Mathematics and natural science: 400::Mathematics: 410::Algebra/algebraic analysis: 414en_US
dc.titleAlmost affine codes and matroidsen_US
dc.typeMaster thesisen_US
dc.typeMastergradsoppgaveen_US


File(s) in this item

Thumbnail
Thumbnail

This item appears in the following collection(s)

Show simple item record