Towards the complete determination of next-to-minimal weights of projective Reed-Muller codes
Let \(\mathbb{F}_q\) be a finite field with \(q\) elements, and denote by \(\mathbb{P}^n(\mathbb{F}_q)\) the projective space of dimension \(n\) defined over \(\mathbb{F}_q\). Consider an integer \(d>0\) and \(a_1, \ldots,a_N\in\mathbb{P}^n(\mathbb{F}_q)\), where \(N = q^n+\cdots+q+1\). The projective Reed-Muller code of order \(d\) defined over \(\mathbb{P}^n(\mathbb{F}_q)\) is the image of the \(\mathbb{F}_q\)-linear transformation \(\phi_d : \mathbb{F}_q[X_1, \ldots , X_n]_d \rightarrow \mathbb{F}_q^N\) given by \(f \mapsto (f (a_1), \ldots , f (a_N ))\), where we write the points with the first nonzero entry from the left equal to 1. This code is denoted by PRM\((n, d)\), and its minimum distance is WPRM\(^{(1)}(n, d) = (q -\ell)q^{n-k-1}\), where \(k\) and \(\ell\) are the unique integers such that \(d-1 = k(q - 1) + \ell\), with \(1 \leq \ell \leq q -1\). In this work, the second lowest Hamming weight WPRM\(^{(2)}(n, d)\) which is also called next-to-minimal weights of PRM\((n, d)\) is computed, in the case where \(n \geq 3\), \(k = n -2\) and \(\ell = 1\), and also in the case where \(n \geq 2\), \(k = n - 2\), \(q\) is even and \(\ell= (q + 2)/2\). The proofs combine results of geometric nature with techniques from Gröbner basis theory.
- On the next-to-minimal weight of projective Reed-Muller codes
- Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
- Maximal weight divisors of projective Reed-Muller codes
- scientific article; zbMATH DE number 125896
- On low weight codewords of generalized affine and projective Reed-Muller codes
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- Homogeneous polynomials vanishing on the projective space \(\mathbb{P}^m(\mathbb{F}_q)\)
- scientific article; zbMATH DE number 52842 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- New generalizations of the Reed-Muller codes--I: Primitive codes
- On generalized ReedMuller codes and their relatives
- On low weight codewords of generalized affine and projective Reed-Muller codes
- On the next-to-minimal weight of affine Cartesian codes
- On the next-to-minimal weight of projective Reed-Muller codes
- Projective reed-muller codes
- Projective Reed-Muller codes
- Reed‐muller codes: an ideal theory approach
- The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes
- The second weight of generalized Reed-Muller codes in most cases
- Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors
- On the next-to-minimal weight of projective Reed-Muller codes
- Projective Reed-Muller type codes on higher dimensional scrolls
- Maximal weight divisors of projective Reed-Muller codes
- Maximal hypersurfaces of degree \(d\) in \({{\mathbb{P}}}^n({{\mathbb{F}}}_q)\) and minimum weight spectrum of the generalized \(PRM (q, d, n)\)-code
- Relative generalized Hamming weights of evaluation codes
- The parameters of projective Reed-Müller codes
This page was built for publication: Towards the complete determination of next-to-minimal weights of projective Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227127)
