On the second Hamming weight of some Reed–Muller type codes

Abstract

We study affine cartesian codes, which are a Reed–Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field Fq. These codes appeared recently in a work by H. López, C. Rentería-Marquez and R. Villareal (see López et al. (2013) [11]) and, in a generalized form, in a work by O. Geil and C. Thomsen (see Geil and Thomsen (2013) [9]). We determine the second Hamming weight (also called next-to-minimal weight) for particular cases of affine cartesian codes and also some higher Hamming weights of this type of code.