Generalized Hamming weights for almost affine codes

TL;DR

This paper extends the concept of generalized Hamming weights from linear codes to almost affine codes, exploring their properties, duality, bounds, and applications to wire-tap channels.

Contribution

It introduces generalized Hamming weights for almost affine codes and demonstrates their properties, duality, and relevance to information security applications.

Findings

Generalized Hamming weights defined for almost affine codes.

Wei duality and Kung's bound extended to this class.

Weight distributions analyzed for infinite code series.

Abstract

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap channels of type II, apply to the larger class of almost affine codes in general. In addition we discuss duality of almost affine codes,and of the smaller class of multilinear codes. We also give results about weight distributions of infinite series of almost affine codes, each series obtained from a fixed code by extending the code alphabet.