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 2 m be a finite field of cardinality 2 m, R= F 2 m+ u F 2 m (u 2= 0) and s, n be positive
integers such that n is odd. In this paper, we give an explicit representation for every self …

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 …

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 …

In our article, a nonlinear density-dependent mortality Nicholson's blowflies system with
patch structure has been investigated, in which the delays are time-varying and multiple …

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 p be any odd prime number, m and s be arbitrary positive integers, and let F pm be the
finite field of cardinality p m. Existing literature only determines the number of all (Euclidean) …