Abstract
For a prime p and integer k > 1, we find the unique set of generators for cyclic codes over . Besides, the necessary and sufficient conditions for cyclic codes to be reversible are obtained. Finally, as an application, some computational examples are given in support of our results.