In this paper, we study quantum error-correcting codes from skew constacyclic codes over
the ring R= F q [u, v]< u 2− 1, v 2− 1, uv− vu>, where q= pm for any odd prime p and positive …

Let p be an odd prime, and k be an integer such that gcd (k, p)= 1. Using pairwise
orthogonal idempotents γ 1, γ 2, γ 3 of the ring ℛ= 𝔽 p [u]/〈 uk+ 1− u〉, with γ 1+ γ 2+ γ 3= 1 …

Let F _q F q be the finite field of order q= p^ mq= pm, where p is a prime, m is a positive
integer, and R= F _q u, v/⟨ u^ 2-u, v^ 2-v, uv-vu ⟩ R= F qu, v/⟨ u 2-u, v 2-v, uv-vu⟩. Thus R …

Symbol-pair codes are used to protect against symbol-pair errors in high density data
storage systems. One of the most important tasks in symbol-pair coding theory is to design …

Let p be an odd prime, and k an integer such that k∣(p− 1). This paper studies quantum
codes from skew cyclic codes over the ring R= F q [u]< u k+ 1− u>, where q is a power of the …

In this paper, we use the CSS and Steane's constructions to establish quantum error-
correcting codes (briefly, QEC codes) from cyclic codes of length 3 ps over F pm. We obtain …

Let F pm be a finite field of cardinality pm where p is an odd prime, n be a positive integer
satisfying gcd (n, p)= 1, and denote R= F pm [u]/< ue> where e≥ 4 be an even integer. Let δ …

In this paper, we use the CSS and Steane's constructions to establish quantum error-
correcting codes (briefly, QEC codes) from cyclic codes of length over. We obtain several …

For any prime number p, positive integers m, k, n, where n satisfies gcd (p, n)= 1, and for any
non-zero element λ 0 of the finite field F pm of cardinality pm, we prove that any λ 0 p k …

In this paper, we first discuss linear codes over R and present the decomposition structure of
linear codes over the mixed alphabet F q R, where R= F q+ u F q+ v F q+ uv F q, with u 2= 1 …