Let p be an odd prime and q = p m , where m is a positive integer. We study the Θ t -cyclic and (Θ t , λ )-cyclic code over a finite commutative non-chain ring R = F q [u, v, w]/ u 2 = u, v 2 = v, w 2 = 1, uv = vu = 0, uw = wu, wv = vw , where λ is a unit in R.
In this work, we have investigated the one generator cyclic DNA codes with reverse and reverse complement constraints over the ring R = Z4 +uZ4 +u 2 Z4 with u 3 = 0. Skew cyclic codes with reverse complement constraint are constructed over R. We have also determined a one-to-one correspondence between the elements of the ring R and DNA codons satisfying the Watson-Crick complement. Finally, we have established some examples which satisfy the given constraints.
In this correspondence, we investigate the covering radius of various types of repetition codes over Z p k ( k ≥ 2 ) 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 Z p k . We also derive the lower and upper bounds on the covering radius of block repetition codes over Z p k .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.