Elementary 2-group character codes

We describe a class of codes over GF(q), where q is a power of an odd prime. These codes are analogs of the binary Reed-Muller codes and share several features in common with them. We determine the minimum weight and properties of these codes. For a subclass of codes we find the weight distribution and prove that the minimum nonzero weight codewords give 1-designs.