For (n,q)=p(s), where p=ch(F-q), s greater than or equal to 1, V a q(m
)-ary repeated-root cyclic code of length n with generator polynomial
g(x), we give a partial answer about whether the q-ary image of V is c
yclic or not with respect to a certain basis for F(q)m over F-q.