Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

For any odd prime p, and a divisor ℓ of p, we consider Ie to be the set of all divisors of p-1,
which are less than or equal to ℓ. In this letter, we construct quantum codes from cyclic codes …

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 F 2 m be a finite field of cardinality 2 m and sa positive integer. Using properties for
Kronecker product of matrices and calculation for linear equations over F 2 m, an efficient …

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 𝔽 pm be a finite field of cardinality pm, where p is an odd prime, k, λ be positive integers
satisfying λ≥ 2, and denote 𝒦= 𝔽 pm [x]/〈 f (x) λ pk〉, where f (x) is an irreducible …

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 …