On low weight codewords of generalized affine and projective Reed-Muller codes
From MaRDI portal
Publication:398932
DOI10.1007/S10623-013-9911-7zbMATH Open1335.94100arXiv1203.4592OpenAlexW2029857487MaRDI QIDQ398932FDOQ398932
Authors: S. Ballet, Robert Rolland 
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1203.4592
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
codeweightfinite fieldhypersurfacepolynomialhyperplanehomogeneous polynomialcodewordgeneralized Reed-Muller codeminimal distancenext-to-minimal distanceprojective Reed-Muller codesecond weight
Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the second weight of generalized Reed-Muller codes
- Projective Reed-Muller codes
- On generalized ReedMuller codes and their relatives
- Title not available (Why is that?)
- Equations over finite fields. An elementary approach
- Number of points of non-absolutely irreducible hypersurfaces
- Special numbers of rational points on hypersurfaces in the \(n\)-dimensional projective space over a finite field
- Second highest number of points of hypersurfaces in \(\mathbb F_q^n\)
- Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
- Highest numbers of points of hypersurfaces over finite fields and generalized Reed-Muller codes
- On the number of points of some hypersurfaces in \(\mathbb{F}^n_q\)
- Reed‐muller codes: an ideal theory approach
- The second weight of generalized Reed-Muller codes in most cases
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- Second weight codewords of generalized Reed-Muller codes
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
- New generalizations of the Reed-Muller codes--I: Primitive codes
- On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
- An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
- Polynomial multiplicities over finite fields and intersection sets
- Homogeneous polynomials vanishing on the projective space \(\mathbb{P}^m(\mathbb{F}_q)\)
- Projective reed-muller codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the linearity of higher-dimensional blocking sets
- Applications of finite fields to combinatorics and finite geometries
- On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
Cited In (16)
- Maximal weight divisors of projective Reed-Muller codes
- Title not available (Why is that?)
- Towards the complete determination of next-to-minimal weights of projective Reed-Muller codes
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- The second weight of generalized Reed-Muller codes in most cases
- Two classes of constacyclic codes with variable parameters
- On the next-to-minimal weight of affine Cartesian codes
- The second and the third smallest arrangements of hyperplanes in finite projective spaces
- Projective nested Cartesian codes
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
- On the third weight of generalized Reed-Muller codes
- On the next-to-minimal weight of projective Reed-Muller codes
- Second weight codewords of generalized Reed-Muller codes
- A gap in GRM code weight distributions
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of 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)
