On the second Hamming weight of some Reed-Muller type codes
Carvalho, Cicero
Original · EN
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. Lopez, C. Renteria-Marquez and R. Villareal and, in a generalized form, in a work by O. Geil and C. Thomsen. Using methods from Gröbner basis theory 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.