Weight enumerator of some irreducible cyclic codes

Abstract

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field ${\mathbb{F}}_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.

Submitted to Designs, Codes and Cryptography, 8 pages