In this paper, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over R s = F p + u 1 F p + • • • + u s F p , u 2 i = u i , u i u j = u j u i = 0, for odd prime p and i, j = 1, 2,. .. , s, i = j. Many QECCs with improved parameters than the existing ones in some of the earlier papers are provided. We present a set of idempotent generators of the ring R s , and using that we define linear codes, determine all units, and study constacyclic codes over this ring. Among others, we study dual containing constacyclic codes over R s and construct (non-binary) QECCs. An algorithm to construct QECCs from dual containing constacyclic codes over R s is obtained that can provide many quantum codes. INDEX TERMS Cyclic codes, negacyclic codes, constacyclic codes, quantum codes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.