An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes

DOI10.1017/9781108773355.010MaRDI QIDQ5164751zbMATH OpenOpenAlexFDO

Authors Victor G. L. Neumann, Cicero Carvalho

Publication date 12 November 2021

Full work available at URL https://arxiv.org/abs/1903.09458, https://www.cambridge.org/core/books/integrable-systems-and-algebraic-geometry/an-extension-of-delsarte-goethals-and-mac-williams-theorem-on-minimal-weight-codewords-to-a-class-of-reedmuller-type-codes/54ADAEB02249A1D2600A14AF3B1113AB

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: In 1970 Delsarte, Goethals and Mac Williams published a seminal paper on generalized Reed-Muller codes where, among many important results, they proved that the minimal weight codewords of these codes are obtained through the evaluation of certain polynomials which are a specific product of linear factors, which they describe. In the present paper we extend this result to a class of Reed-Muller type codes defined on a product of (possibly distinct) finite fields of the same characteristic. The paper also brings an expository section on the study of the structure of low weight codewords, not only for affine Reed-Muller type codes, but also for the projective ones.

Recommendations

• A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
• Weighted Reed-Muller codes and algebraic-geometric codes
• On low weight codewords of generalized affine and projective Reed-Muller codes
• On the weight structure of Reed-Muller codes
• A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes

Cited in

(6)

• Minimal codewords in Reed-Muller codes
• Minimum-weight codewords as generators of generalized Reed-Muller codes
• On the next-to-minimal weight of affine Cartesian codes
• On low weight codewords of generalized affine and projective Reed-Muller codes
• A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
• Completing the determination of the next-to-minimal weights of affine cartesian codes

This page was built for publication: An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164751)