On the second Hamming weight of some Reed-Muller type codes
From MaRDI portal
(Redirected from Publication:2447799)
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.
Recommendations
- On the next-to-minimal weight of affine Cartesian codes
- The second weight of generalized Reed-Muller codes in most cases
- Relative generalized Hamming weights of affine Cartesian codes
- Generalized Hamming weights of affine Cartesian codes
- Completing the determination of the next-to-minimal weights of affine cartesian codes
Cites work
- Affine Cartesian codes
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- Decoding affine variety codes using Gröbner bases
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- On generalized ReedMuller codes and their relatives
- On the number of points of some hypersurfaces in \(\mathbb{F}^n_q\)
- On the second weight of generalized Reed-Muller codes
- Second weight codewords of generalized Reed-Muller codes
- The second weight of generalized Reed-Muller codes in most cases
- Weighted Reed-Muller codes revisited
Cited in
(30)- Generalized Hamming weights and some parameterized codes
- On the Alon-Füredi bound
- Direct products in projective Segre codes
- scientific article; zbMATH DE number 5693651 (Why is no real title available?)
- On zeros of a polynomial in a finite grid
- Generalized minimum distance functions
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- On the next-to-minimal weight of affine Cartesian codes
- Erratum to: ``On the second weight of generalized Reed-Muller codes
- Relative generalized Hamming weights of evaluation codes
- The dual of an evaluation code
- Generalized Hamming weights of projective Reed-Muller-type codes over graphs
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Codes over a weighted torus
- Evaluation codes and their basic parameters
- Minimum distance functions of complete intersections
- Generalized Hamming weights of affine Cartesian codes
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- Projective nested Cartesian codes
- Affine Cartesian codes
- Completing the determination of the next-to-minimal weights of affine cartesian codes
- On the generalized Hamming weights of certain Reed-Muller-type codes
- The second generalized Hamming weight of certain Castle codes
- Footprint and minimum distance functions
- Relative generalized Hamming weights of affine Cartesian codes
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Affine Cartesian codes with complementary duals
- Complete intersection vanishing ideals on sets of clutter type over finite fields
- Second weight codewords of generalized Reed-Muller codes
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)
