In this correspondence, we investigate the covering radius of various types of repetition codes over with respect to the Lee distance. We determine the exact covering radius of the various repetition codes, which have been constructed using the zero divisors and units in . We also derive the lower and upper bounds on the covering radius of block repetition codes over .
In this note, we study skew cyclic and skew constacyclic codes over the mixed alphabet , where p is an odd prime with m odd and with , and with Such codes consist of the juxtaposition of three codes of the same size over and , respectively. We investigate the generator polynomial for skew cyclic codes over . Furthermore, we discuss the structural properties of the skew cyclic and skew constacyclic codes over We also study their q-ary images under suitable Gray maps.
In this note, we study skew cyclic and skew constacyclic codes over the mixed alphabet R = F q R 1 R 2 where R 1 = F q + uF q with u 2 = u and R 2 = F q + uF q + vF q with u 2 = u, v 2 = v, uv = vu = 0. Such codes consist of the juxtaposition of three codes of the same size over respectively F q , R 1 , and R 2. We investigate the generator polynomial for skew cyclic codes over R. Furthermore, we discuss the structural properties of the skew cyclic and skew constacyclic codes over R. We also study their q-ary images under suitable Gray maps.
1 January 2024 in Journal of Discrete Mathematical Sciences and Cryptography
This paper considers (1+2u) -constacyclic and (1+2u) -skew constacyclic codes over the ring R = Z4[u,v]/, and some Gray maps over this ring are presented. The Gray images of these codes are shown to be cyclic, quasi-cyclic, and permutation equivalent to quasi-cyclic codes. In addition, (1+2u) constacyclic codes are given with images that are new Z4 codes according to the online database of linear Z4 codes [3].
6 May 2026 in Journal of Algebra Combinatorics Discrete Structures and Applications
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.