A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
From MaRDI portal
Publication:413560
DOI10.1016/j.ffa.2011.12.003zbMath1297.94123OpenAlexW2963007070MaRDI QIDQ413560
Publication date: 7 May 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2011.12.003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25)
Related Items (7)
Second weight codewords of generalized Reed-Muller codes ⋮ On low weight codewords of generalized affine and projective Reed-Muller codes ⋮ New classes of affine-invariant codes sandwiched between Reed-Muller codes ⋮ On the fourth weight of generalized Reed-Muller codes ⋮ On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes ⋮ On the next-to-minimal weight of affine Cartesian codes ⋮ On the third weight of generalized Reed-Muller codes
Cites Work
This page was built for publication: A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
