On low weight codewords of generalized affine and projective Reed-Muller codes
From MaRDI portal
(Redirected from Publication:398932)
Abstract: We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight codewords are products of affine functions. Then in the general case we study some types of codewords and prove that they cannot be second, thirds or fourth weight depending on the hypothesis. In the projective case the second distance of generalized Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
Recommendations
- Second weight codewords of generalized Reed-Muller codes
- On the second weight of generalized Reed-Muller codes
- The second weight of generalized Reed-Muller codes in most cases
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
Cites work
- scientific article; zbMATH DE number 3135133 (Why is no real title available?)
- scientific article; zbMATH DE number 52842 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
- An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
- Applications of finite fields to combinatorics and finite geometries
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- Equations over finite fields. An elementary approach
- Highest numbers of points of hypersurfaces over finite fields and generalized Reed-Muller codes
- Homogeneous polynomials vanishing on the projective space \(\mathbb{P}^m(\mathbb{F}_q)\)
- Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Number of points of non-absolutely irreducible hypersurfaces
- On generalized ReedMuller codes and their relatives
- On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
- On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
- On the linearity of higher-dimensional blocking sets
- On the number of points of some hypersurfaces in \(\mathbb{F}^n_q\)
- On the second weight of generalized Reed-Muller codes
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- Polynomial multiplicities over finite fields and intersection sets
- Projective Reed-Muller codes
- Projective reed-muller codes
- Reed‐muller codes: an ideal theory approach
- Second highest number of points of hypersurfaces in \(\mathbb F_q^n\)
- Second weight codewords of generalized Reed-Muller codes
- Special numbers of rational points on hypersurfaces in the \(n\)-dimensional projective space over a finite field
- The second weight of generalized Reed-Muller codes in most cases
Cited in
(16)- On the third weight of generalized Reed-Muller codes
- Projective nested Cartesian codes
- On the next-to-minimal weight of projective Reed-Muller codes
- Towards the complete determination of next-to-minimal weights of projective Reed-Muller codes
- Second weight codewords of generalized Reed-Muller codes
- The second and the third smallest arrangements of hyperplanes in finite projective spaces
- The second weight of generalized Reed-Muller codes in most cases
- On the next-to-minimal weight of affine Cartesian codes
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
- A gap in GRM code weight distributions
- Maximal weight divisors of projective Reed-Muller codes
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
- scientific article; zbMATH DE number 7691472 (Why is no real title available?)
- Two classes of constacyclic codes with variable parameters
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
This page was built for publication: On low weight codewords of generalized affine and projective Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398932)
