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

From MaRDI portal
Publication:5164751

DOI10.1017/9781108773355.010zbMATH Open1473.94135arXiv1903.09458OpenAlexW2923595048MaRDI QIDQ5164751FDOQ5164751


Authors: Victor G. L. Neumann, Cicero Carvalho Edit this on Wikidata


Publication date: 12 November 2021

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.


Full work available at URL: https://arxiv.org/abs/1903.09458




Recommendations




Cited In (4)





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)