Generalized Hamming Weights for Almost Affine Codes
We define generalized Hamming weights for almost affine codes. We show that this definition is natural since we can extend some well known properties of t he generalized Hamming weights for linear codes, to almost affine codes. In addition we discus s duality of almost affine codes, and of the smaller class of multilinear codes.
Published version available in IEEE Transactions on Information Theory 2017, 63 (4).