2010/01/14 by Leducq, Elodie
#94B05 #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1001.2554
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.