Minimum-weight codewords as generators of generalized Reed-Muller codes
From MaRDI portal
Recommendations
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
- Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors
- Minimal codewords in Reed-Muller codes
- The second weight of generalized Reed-Muller codes in most cases
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
Cited in
(17)- Minimum distance and the minimum weight codewords of Schubert codes
- Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors
- Symplectic spread-based generalized Kerdock codes
- scientific article; zbMATH DE number 67092 (Why is no real title available?)
- Blakley type secret sharing scheme based on the intersection of subspaces
- Designer of codes: a tribute to Jennifer Key
- Another generalisation of the binary Reed-Muller codes and its applications
- New class of double inductive error correcting codes based on the class of GRM and DGRM codes over \(\mathrm{GF}(2)\)
- Small sets of even type in finite projective planes of even order
- On the number of q-ary quasi-perfect codes with covering radius 2
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
- Minimum weight bases for quaternary Reed-Muller codes
- Polynomials meeting Ax's bound
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Testing low-degree polynomials over prime fields
- On nonlinear 1-quasi-perfect codes and their structural properties
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
This page was built for publication: Minimum-weight codewords as generators of generalized Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2705936)
