In this work, a method is given to construct quantum codes from cyclic codes over F4 + vF4 which will be denoted as R throughout the paper, where v2 = v and a Gray map is defined between R and where F4 is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.
QUATERNARY CONSTRUCTION OF QUANTUM CODES FROM CYCLIC CODES OVER F4+uF4
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.
The purpose of this paper is to identify the structural characteristics and construction of quantum codes over Fp using $\alpha_1+\alpha_2 {\mu}+\alpha_3 {\nu}+\alpha_4 {\varpi}+\alpha_5 {\mu}{\nu}+\alpha_6 {\nu}{\varpi}+\alpha_7 {\mu}{\varpi}+\alpha_8 {\mu}{\nu}{\varpi}- $constacyclic codes over ring R=Fp[μ,ν,ϖ]/<μ2−μ,ν2−ν,ϖ2−ϖ,μν−νμ,νϖ−ϖν,μϖ−ϖμ>, here Fp is a finite field with p elements. We define a Gray map from R to Fp8, a distance-preserving map. Breaking down constacyclic codes into cyclic and negacyclic codes results in the creation of quantum codes over the finite field Fp. As an application, some examples are illustrated to obtain the quantum codes of different parameters.
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.