Almost affine codes and matroids
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.
PublisherUiT Norges arktiske universitet
UiT The Arctic University of Norway
The following license file are associated with this item: