A tight upper bound on the number of non-zero weights of a quasi-cyclic code

11/07/2022

∙

by   Xiaoxiao Li, et al.

∙

0

∙

share

Let 𝒞 be a quasi-cyclic code of index l(l≥2). Let G be the subgroup of the automorphism group of 𝒞 generated by ρ^l and the scalar multiplications of 𝒞, where ρ denotes the standard cyclic shift. In this paper, we find an explicit formula of orbits of G on 𝒞∖{0}. Consequently, an explicit upper bound on the number of non-zero weights of 𝒞 is immediately derived and a necessary and sufficient condition for codes meeting the bound is exhibited. In particular, we list some examples to show the bounds are tight. Our main result improves and generalizes some of the results in <cit.>.