scholarly journals Quantum Codes Obtained through Constacyclic Codes over Z3 + νZ3 + ωZ3 + νωZ3

2021 ◽  
Vol 14 (3) ◽  
pp. 1082-1097
Author(s):  
Jagbir Singh ◽  
Prateek Mor ◽  
Shikha . ◽  
Meena .

This paper is concerned with, structural properties and construction of quantum codes over Z3 by using constacyclic codes over the finite commutative non-chain ring R = Z3 + νZ3 + ωZ3 + νωZ3 where ν2 = 1, ω2 = ω, νω = νω, and Z3 is field having 3 elements with characteristic 3. A Gray map is defined between R and Z43. The parameters of quantum codes over Z3 are obtained by decomposing constacyclic codes into cyclic and negacyclic codes over Z3. As an application, some examples of quantum codes of arbitrary length, are also obtained.

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ram Krishna Verma ◽  
Om Prakash ◽  
Ashutosh Singh ◽  
Habibul Islam

<p style='text-indent:20px;'>For an odd prime <inline-formula><tex-math id="M1">\begin{document}$ p $\end{document}</tex-math></inline-formula> and positive integers <inline-formula><tex-math id="M2">\begin{document}$ m $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ \ell $\end{document}</tex-math></inline-formula>, let <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_{p^m} $\end{document}</tex-math></inline-formula> be the finite field with <inline-formula><tex-math id="M5">\begin{document}$ p^{m} $\end{document}</tex-math></inline-formula> elements and <inline-formula><tex-math id="M6">\begin{document}$ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $\end{document}</tex-math></inline-formula>. Thus <inline-formula><tex-math id="M7">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula> is a finite commutative non-chain ring of order <inline-formula><tex-math id="M8">\begin{document}$ p^{2^{\ell} m} $\end{document}</tex-math></inline-formula> with characteristic <inline-formula><tex-math id="M9">\begin{document}$ p $\end{document}</tex-math></inline-formula>. In this paper, we aim to construct quantum codes from skew constacyclic codes over <inline-formula><tex-math id="M10">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula>. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.</p>


2018 ◽  
Vol 10 (04) ◽  
pp. 1850046 ◽  
Author(s):  
Juan Li ◽  
Jian Gao ◽  
Yongkang Wang

In this paper, structural properties of [Formula: see text]-constacyclic codes over the finite non-chain ring [Formula: see text] are studied, where [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] is a power of some odd prime. As an application, some better quantum codes, compared with previous work, are obtained.


2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo

Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for the special case when the alphabet is the finite field [Formula: see text] (i.e., [Formula: see text]), the symbol-pair distance distribution of constacyclic codes over [Formula: see text] verifies the Singleton bound for such symbol-pair codes, and provides all maximum distance separable symbol-pair constacyclic codes of length [Formula: see text] over [Formula: see text].


Author(s):  
Teeramet Inchaisri ◽  
Jirayu Phuto ◽  
Chakkrid Klin-Eam

In this paper, we focus on the algebraic structure of left negacyclic codes of length [Formula: see text] over the finite non-commutative chain ring [Formula: see text] where [Formula: see text] is an automorphism on [Formula: see text]. After that, the number of codewords of all left negacyclic codes is obtained. For each left negacyclic code, we also obtain the structure of its right dual code. In the remaining result, the number of distinct left negacyclic codes is given. Finally, a one-to-one correspondence between left negacyclic and left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] is constructed via ring isomorphism, which carries over the results regarding left negacyclic codes corresponding to left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] where [Formula: see text] is a nonzero element of the field [Formula: see text] such that [Formula: see text].


2020 ◽  
Vol 87 (3-4) ◽  
pp. 231
Author(s):  
Saroj Rani

In this paper, we establish the algebraic structure of all cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over the chain ring Fp<sup>m</sup> + uFp<sup>m</sup> in terms of their generator polynomials, where u<sup>2</sup> = 0 and s is a positive integer and p is an odd prime. We also find out the number of codewords in each of these cyclic codes. Besides this, we determine duals of cyclic codes and list self-dual cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>. Also, we determine μ and -constacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>.


2014 ◽  
Vol 12 (06) ◽  
pp. 1450042 ◽  
Author(s):  
Mohammad Ashraf ◽  
Ghulam Mohammad

Let R = F3 + vF3 be a finite commutative ring, where v2 = 1. It is a finite semi-local ring, not a chain ring. In this paper, we give a construction for quantum codes from cyclic codes over R. We derive self-orthogonal codes over F3 as Gray images of linear and cyclic codes over R. In particular, we use two codes associated with a cyclic code over R of arbitrary length to determine the parameters of the corresponding quantum code.


2015 ◽  
Vol 13 (03) ◽  
pp. 1550031 ◽  
Author(s):  
Abdullah Dertli ◽  
Yasemin Cengellenmis ◽  
Senol Eren

In this paper, quantum codes from cyclic codes over A2 = F2 + uF2 + vF2 + uvF2, u2 = u, v2 = v, uv = vu, for arbitrary length n have been constructed. It is shown that if C is self orthogonal over A2, then so is Ψ(C), where Ψ is a Gray map. A necessary and sufficient condition for cyclic codes over A2 that contains its dual has also been given. Finally, the parameters of quantum error correcting codes are obtained from cyclic codes over A2.


Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 303
Author(s):  
Sami Alabiad ◽  
Yousef Alkhamees

Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R. We first reduce this to investigate constacyclic codes of length ps (N=n1ps,p∤n1) over a certain finite chain ring CR(uk,rb) of characteristic p, which is an extension of R. Then we use discrete Fourier transform (DFT) to construct an isomorphism γ between R[x]/<xN−λ> and a direct sum ⊕b∈IS(rb) of certain local rings, where I is the complete set of representatives of p-cyclotomic cosets modulo n1. By this isomorphism, all codes over R and their dual codes are obtained from the ideals of S(rb). In addition, we determine explicitly the inverse of γ so that the unique polynomial representations of λ-constacyclic codes may be calculated. Finally, for k=2 the exact number of such codes is provided.


2016 ◽  
pp. 39-49
Author(s):  
Mustafa Sari ◽  
Irfan Siap

In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F_2 [u] / (u^s ) to F^s_2 where F_2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F_2 [u] / (u^s ) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum error correcting (QEC) codes and we finally illustrate our results by presenting some examples with good parameters.


2019 ◽  
Vol 19 (12) ◽  
pp. 2150003 ◽  
Author(s):  
Hai Q. Dinh ◽  
Tushar Bag ◽  
Ashish K. Upadhyay ◽  
Mohammad Ashraf ◽  
Ghulam Mohammad ◽  
...  

Let [Formula: see text] be an odd prime, and [Formula: see text] be an integer such that [Formula: see text]. Using pairwise orthogonal idempotents [Formula: see text] of the ring [Formula: see text], with [Formula: see text], [Formula: see text] is decomposed as [Formula: see text], which contains the ring [Formula: see text] as a subring. It is shown that, for [Formula: see text], [Formula: see text], and it is invertible if and only if [Formula: see text] and [Formula: see text] are units of [Formula: see text]. In such cases, we study [Formula: see text]-constacyclic codes over [Formula: see text]. We present a direct sum decomposition of [Formula: see text]-constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a [Formula: see text]-constacyclic code to contain its dual are obtained. As an application, many new quantum codes over [Formula: see text], with better parameters than existing ones, are constructed from cyclic and negacyclic codes over [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document