In this paper, we extend the results given in [3] to a nonchain ring
Rp=Fp+vFp+⋯+vp−1Fp , where
vp=v and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring
Rp and study the structure of their duals. We classify cyclic codes containing their duals over
Rp by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map
π defined in [4], we give the parameters of the quantum codes of length pn over
Fp which are obtained from cyclic codes over
Rp . Finally, we illustrate the results by giving some examples.
Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary length ps, and determine the true minimum distance of all those codes. Some proposed quantum cyclic codes are optimal. Additionally, some proposed asymmetric quantum cyclic codes have better parameters than the ones available in the literature.