-cyclic codes over and their applications in the construction of quantum codes
arXiv:2501.01708
Abstract
In this article, for a finite field and a natural number let denote the product ring Firstly, for an automorphism of a -derivation of and for a unit in we study -cyclic codes over In this direction, we give an algebraic characterization of a -cyclic code over , determine its generator polynomial, and find its decomposition over Secondly, we give a necessary and sufficient condition for a -cyclic code to be Euclidean dual-containing code over Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over as Gray images of -cyclic codes over Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.