Weight enumeration of codes from finite spaces (Q411495)

This article gives the generalized and extended weight enumerators of the \(q\)-ary simplex codes and the \(q\)-ary first-order Reed-Muller codes. The key for the computation of the generalized weight enumerator is the translation of the codes into projective systems. Thereby, the simplex codes correspond to the full point set of a projective geometry, and the Reed-Muller codes correspond to a maximal affine subgeometry. Now the generalized weights are determined by the intersection numbers of the projective system with the different projective subspaces of the ambient geometry. Having found the generalized weight enumerators in this way, the extended weight enumerators are derived.