This article studies Θt-cyclic and (Θt, λ)-constacyclic codes over the finite commutative non-chain Frobenius ring R = Fq[u, v, w] / 〈 u2 − u, v2 − v, w2 − 1, uv, uw − wu, wv − vw 〉. Gray maps, structural decompositions, and generator descriptions are developed for both odd- and even-characteristic cases. The paper further determines principal generators in the associated skew polynomial rings, dual codes, idempotent generators, and conditions for self-duality. It also presents explicit examples over specific finite fields and extends the framework to DNA codes in the even-characteristic setting through reversibility and complement constraints. Spanning sets, cardinality formulas, and optimal DNA-code constructions meeting the Griesmer bound are also obtained.
6 May 2026 in Journal of Algebra Combinatorics Discrete Structures and Applications
In this paper, we study polycyclic codes over the ring Rl = Fq[w] / 〈wl − 1〉 with q = pk, where k is a positive integer and p is an odd prime. We explore LCD annihilator, self-dual, self-orthogonal codes over Rl and polycyclic codes over Rl. Moreover, we provide a structure of entanglement-assisted quantum error-correcting codes based on the developed polycyclic codes through the inclusion of dual contained conditions. Subsequently, some LCD hull code-derived entanglement-assisted quantum error-correcting code examples are presented.