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 …

In emerging storage technologies, the outputs of the channels consist of overlapping pairs of
symbols. The errors are no longer individual symbols. Controlling them calls for a different …

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 …

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 …

Symbol-pair code is a new coding framework proposed to combat pair-errors in symbol-pair
read channels. Remarkably, a classical maximum distance separable (MDS) code is also an …

Let R= F pm+ u F pm with u 2= 0, where m, s are positive integers and p is an odd prime. For
any invertible element Λ of R, the symbol-pair distances of all Λ-constacyclic codes of length …

In order to correct the pair-errors generated during the transmission of modern high-density
data storage that the outputs of the channels consist of overlapping pairs of symbols, a new …

Let be any odd prime. Using the algebraic structures of all cyclic codes of length over the
finite commutative chain ring, in this paper, the exact values of Hamming distances of all …