A Tight Upper Bound on the Number of Non-Zero Weights of a Cyclic Code

Let C be a simple-root cyclic code and let G be the subgroup of the automorphism group of C generated by the cyclic shift of C and the scalar multiplications of C. In this paper, we find an explicit formula for the number of orbits of G on C \ {0}. Consequently, an explicit upper bound on the number of non-zero weights of C is immediately derived and a necessary and sufficient condition for codes meeting the bound is exhibited. Several reducible and irreducible cyclic codes meeting the bound are presented, revealing that our bound is tight. In particular, we find that some infinite families of irreducible cyclic codes constructed in (Ding, 2009) meet our bound; we then conclude that such known codes enjoy an additional property that any two codewords with the same weight belong to the same G-orbit, a fact that may not have been known before. Our main result improves and generalizes some of the results in (Shi et al., 2019).