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

From MaRDI portal
Publication:2447799

DOI10.1016/J.FFA.2013.06.004zbMATH Open1306.94118arXiv1306.4727OpenAlexW2059629370MaRDI QIDQ2447799FDOQ2447799


Authors: Cicero Carvalho Edit this on Wikidata


Publication date: 29 April 2014

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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 F_q. 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"obner 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.


Full work available at URL: https://arxiv.org/abs/1306.4727




Recommendations




Cites Work


Cited In (30)





This page was built for publication: On the second Hamming weight of some Reed-Muller type codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447799)