Cyclically permutable codes specified by roots of generator polynomial

A condition is proven on the roots of the generator polynomial of a q-ary cyclic code of block length n which guarantees full cyclic order for all nonzero codewords. For such cyclic codes having n = q^m- 1, a theorem is proven which allows to partition the set of all nonzero codewords into cyclic equivalence classes of order n.