Symmetries of weight enumerators and applications to Reed-Muller codes (Q2415395): Difference between revisions

The paper deals with a generalization of Gleason's theorem for the weight enumerators of self-dual codes. The authors seek to determine what the possible groups of symmetries of a weight enumerator are and how to compute them efficiently. If these have been computed, then they seek to prove they are symmetries of other weight enumerators for a family of codes and to determine new properties or unknown weight enumerators. Firstly, they prove that if $V(p(x,y))$ is the set of roots of the polynomial in the projective line $\mathbb{P}(\mathbb{C})$, then the group of symmetries of the weight enumerator $p(x,y)$ of a code is finite if and only if $\# V(p(x,y)) \geq 3$. They list the possible groups of symmetries and develop a new algorithm for computing the group of symmetries of a given weight enumerator. Finally, they apply these techniques to Reed-Muller codes and produce an analogue of Gleason's theorem for all parameters in the binary case.