Answers are grounded in this paper and cite their sources.
For an odd prime p and positive integers m and , let Fpᵐ be the finite field with pᵐ elements and R,m = Fpᵐ[v₁,v₂,,v_]/ v²ᵢ-1, vᵢvⱼ-vⱼvᵢ1≤ i, j≤. Thus R,m is a finite commutative non-chain ring of order p^2^ m with characteristic p. In this paper, we aim to construct quantum codes from skew constacyclic codes over R,m. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
No takes yet. Share an insight, caveat, or question.
Verma et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: