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 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 …

Let Z= F pm [u]/(u 3) be the finite commutative chain ring, where p is a prime, m is a positive
integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated …

For any prime p and positive integer m, let R be the finite commutative ring F _ p^ m+ u F _
p^ m+ v F _ p^ m+ uv F _ p^ m F pm+ u F pm+ v F pm+ uv F pm, where u^ 2= 0, v^ 2= 0 u 2 …

In this research paper, the repeated-root constacyclic codes over the chain ring F p m+ uF
pm are considered, where p is a prime and m> 0 is any integer. The b-symbol distance for …

Constructing codes that are easy to encode and decode, can detect and correct many errors
and have a sufficiently large number of codewords is the primary aim of coding theory …

Let $\mathbb {F} _ {2^ m} $ be a finite field of cardinality $2^ m $, $\lambda $ and $ k $ be
integers satisfying $\lambda, k\geq 2$ and denote $ R=\mathbb {F} _ {2^ m}[u]/\langle …