Abstract
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a finite projective or affine space. As a result from the geometric method we use for the weight enumeration, we also completely determine the set of supports of subcodes and words in an extension code.
| Original language | English |
|---|---|
| Pages (from-to) | 321-330 |
| Journal | Designs, Codes and Cryptography |
| Volume | 63 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2012 |