In this paper, the quantum codes over F_q are constructed by using the cyclic codes over Y_q=F_q+uF_q+vF_q+uvF_q with u^2=1,v^2=1,uv=vu, and q=p^m,p is an odd prime. Moreover, the parameters of quantum codes over F_q are determined.
Let R = Fq+ uFq+ vFq+ uvFq, with u2= u, v2= v, uv = vu, where q = pmfor a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr- 1) × R[x]/(xs- 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.
QUANTUM CODES FROM CYCLIC CODES OVER Fq+uFq+vFq
In this paper, we investigate the method of constructing quantum codes from cyclic codes over the ring R=Fq+uFq+vFq (u2=u, v2=v, uv=vu=0). By means of the generator polynomials and some decomposition of cyclic codes and their dual over R, we give a necessary and sufficient condition of the cyclic codes over R to be construct the quantum codes. Also as an application, we obtain new non binary quantum codes from those classes of cyclic codes.