Cruz Mohan

Dr. Cruz Mohan

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2020 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
KGKarthick Gowdhaman
Karthick Gowdhaman
CMCruz Mohan
Cruz Mohan
DCDurairajan Chinnapillai
Durairajan Chinnapillai
JGJian Gao
Jian Gao

3 March 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
CMCruz Mohan
Cruz Mohan
CDChinnapillai Durairajan
Chinnapillai Durairajan
Patrick SoléPatrick Solé
Patrick Solé
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 .

28 May 2024 in Axioms
Verified
Journal Article
Open access
PDF file
KGKarthick Gowdhaman
Karthick Gowdhaman
CMCruz Mohan
Cruz Mohan
CDChinnapillai Durairajan
Chinnapillai Durairajan
Selda ÇalkavurSelda Çalkavur
Selda Çalkavur
Patrick SoléPatrick Solé
Patrick Solé
In this note, we study skew cyclic and skew constacyclic codes over the mixed alphabet R=FqR1R2, where q=pm, p is an odd prime with m odd and R1=Fq+uFq with u2=u, and R2=Fq+uFq+vFq with u2=u,v2=v,uv=vu=0. Such codes consist of the juxtaposition of three codes of the same size over Fq,R1, and R2, respectively. 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.

27 November 2023 in HAL
Verified
Preprint
Open access
PDF file
KGKarthick Gowdhaman
Karthick Gowdhaman
CMCruz Mohan
Cruz Mohan
CDChinnapillai Durairajan
Chinnapillai Durairajan
Selda ÇalkavurSelda Çalkavur
Selda Çalkavur
Patrick SoléPatrick Solé
Patrick Solé
CSChinnapillai Durairajan • D Selda
Chinnapillai Durairajan • D Selda
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
Verified
Journal Article
Closed access
KGKarthick Gowdhaman
Karthick Gowdhaman
Thomas Aaron GulliverThomas Aaron Gulliver
Thomas Aaron Gulliver
CMCruz Mohan
Cruz Mohan
DCDurairajan Chinnapillai
Durairajan Chinnapillai
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
Verified
Journal Article
Closed access
CMCruz Mohan
Cruz Mohan
KGKarthick Gowdhaman
Karthick Gowdhaman
Gokul RadhakrishnanGokul Radhakrishnan
Gokul Radhakrishnan
DCDurairajan Chinnapillai
Durairajan Chinnapillai
ISIrfan Siap
Irfan Siap
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.