Çalışkan, FatmaYıldırım, TülayAksoy, Refia2024-06-132024-06-1320230020-77481572-957510.1007/s10773-023-05294-z2-s2.0-85147179346https://doi.org/10.1007/s10773-023-05294-zhttps://hdl.handle.net/11501/1100In this paper, we study cyclic codes over the ring F-p x (F-p + vF(p)), where p is an odd prime and v(2) = v. We first investigate the properties of the ring F-p x (F-p + vF(p)) and the linear codes over this ring. We also define a distance-preserving Gray map from F(p)x(F-p+vF(p)) to F-p(3). We discuss cyclic codes and their dual codes over the ring. Also, we define a set of generators for these codes. As an implementation, we show that quantum error-correcting codes can be obtained from dual containing cyclic codes over the ring by using the CalderbankShor-Steane (CSS) construction. Furthermore, we give some illustrative examples. Finally, we tabulate the non-binary quantum error-correcting codes obtained from cyclic codes over the ring.eninfo:eu-repo/semantics/closedAccessCyclic CodesGenerator PolynomialsQuantum CodesArticle2Q362WOS:000926366900001Q3