Chinnappillai Durairajan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Chinnappillai Durairajan has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- N. Annamalai
Department of Computational Science and Humanities, Indian Institute of Information Technology Kottayam, Pala 686635, Kerala, India
9 shared publications - Cruz Mohan
Department of Mathematics, Bishop Heber College, Bharathidasan University, Tiruchirapalli 620017, Tamil Nadu, India
7 shared publications - Gokul Radhakrishnan
Department of Mathematics, Bharathidasan University, Tiruchirappalli 620024, Tamil Nadu, India
3 shared publications - Karthick Gowdhaman
Department of Mathematics, Presidency University, Bengaluru 560064, Karnataka, India
3 shared publications - Karthick Gowdhaman
Department of Mathematics, School of Advanced Sciences (SAS), Vellore Institute of Technology (VIT) Chennai Campus, Chennai-600127, Tamil Nadu, India
3 shared publications N. Annamalai
Department of Mathematics, Bharathidasan University, Tiruchirappalli-620 024, Tamil Nadu, India
3 shared publications
Latest Publications
- 30 May 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Skew polycyclic codes over 𝔽q + u𝔽q + v𝔽q + uv𝔽q
In this paper, we study skew polycyclic codes over the ring [ ] where [ ] and [ ] where [ ] is an odd prime. We investigate the structural properties of skew polycyclic codes over [ ] through a decomposition theorem. Furthermore, we examine the dual codes of skew polycyclic codes over R, providing necessary and sufficient conditions for a code to be self-dual. We investigate the Gray images of skew polycyclic codes over R, focusing on codes with good parameters. We discuss skew polycyclic codes over the ring [ ] with even characteristic and provide several illustrative examples to support the theoretical results.
- 30 May 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Skew polycyclic codes over 𝔽q + u𝔽q + v𝔽q + uv𝔽q
In this paper, we study skew polycyclic codes over the ring [ ] where [ ] and [ ] where [ ] is an odd prime. We investigate the structural properties of skew polycyclic codes over [ ] through a decomposition theorem. Furthermore, we examine the dual codes of skew polycyclic codes over R, providing necessary and sufficient conditions for a code to be self-dual. We investigate the Gray images of skew polycyclic codes over R, focusing on codes with good parameters. We discuss skew polycyclic codes over the ring [ ] with even characteristic and provide several illustrative examples to support the theoretical results.
- 6 May 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 253-271
Skew cyclic codes over a finite non-chain ring and an application
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
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 253-271
Skew cyclic codes over a finite non-chain ring and an application
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
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 225-234
EAQEC codes from polycyclic codes over the ring R_l
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.
- 6 May 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 225-234
EAQEC codes from polycyclic codes over the ring R_l
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.
- Open Access
Skew Cyclic and Skew Constacyclic Codes over a Mixed Alphabet
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.Open AccessSkew Cyclic and Skew Constacyclic Codes over a Mixed Alphabet
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. - 1 January 2024
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 27 (6) , 1867-1885
Constacyclic codes over the non-chain finite commutative ring 4 2 2 [ , ] , , u v 〈u − u v uv〉
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].
- 1 January 2024
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 27 (6) , 1867-1885
Constacyclic codes over the non-chain finite commutative ring 4 2 2 [ , ] , , u v 〈u − u v uv〉
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].
- Open Access
Skew Cyclic and Skew Constacyclic Codes over a mixed alphabet
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.
Open AccessSkew Cyclic and Skew Constacyclic Codes over a mixed alphabet
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 2023
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (1) , 115-120
Exponent of cyclic codes over Fq
In this paper, we introduce the exponent of a cyclic code over the finite field F-q with q = p(m) elements. Also, we prove that the exponent of the dual of cyclic code satisfies the condition n = lcm(e, r) where n is the length of the cyclic code, e = exp(C) and r = exp(C-perpendicular to).
- 1 January 2023
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (1) , 115-120
Exponent of cyclic codes over Fq
In this paper, we introduce the exponent of a cyclic code over the finite field F-q with q = p(m) elements. Also, we prove that the exponent of the dual of cyclic code satisfies the condition n = lcm(e, r) where n is the length of the cyclic code, e = exp(C) and r = exp(C-perpendicular to).
- 23 February 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (2) , 1-9
Codes from the incidence matrices of a zero-divisor graphs
In this paper, we examine the linear codes with respect to the Hamming metric from incidence matrices of the zero-divisor graphs with vertex set consisting of all non-zero zero- divisors of the ring ℤn and two distinct vertices being adjacent if their product is zero over ℤn. The main parameters of the codes are obtained.
- 23 February 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (2) , 1-9
Codes from the incidence matrices of a zero-divisor graphs
In this paper, we examine the linear codes with respect to the Hamming metric from incidence matrices of the zero-divisor graphs with vertex set consisting of all non-zero zero- divisors of the ring ℤn and two distinct vertices being adjacent if their product is zero over ℤn. The main parameters of the codes are obtained.
- 17 November 2021
- Published by Taru Publications in Journal of Information and Optimization Sciences
- Vol. 42 (8) , 1943-1950
Linear codes from incidence matrices of unit graphs
In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph G(Z(n)) with vertex set is Z(n) and two distinct vertices x and y being adjacent if and only if x + y is unit. The main parameters of the codes are given.
- 17 November 2021
- Published by Taru Publications in Journal of Information and Optimization Sciences
- Vol. 42 (8) , 1943-1950
Linear codes from incidence matrices of unit graphs
In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph G(Z(n)) with vertex set is Z(n) and two distinct vertices x and y being adjacent if and only if x + y is unit. The main parameters of the codes are given.
- Open AccessAdditive Tridiagonal Codes over $\mathbb{F}_{4}$In this paper, we introduce a additive Tridiagonal and Double-Tridiagonal codes over $\mathbb{F}_4$ and then we study the properties of the code. Also, we find the number of additive Tridiagonal codes over $\mathbb{F}_4.$ Finally, we study the applications of Double-Tridiagonal codes to secret sharing scheme based on matrix projection.Open AccessAdditive Tridiagonal Codes over $\mathbb{F}_{4}$In this paper, we introduce a additive Tridiagonal and Double-Tridiagonal codes over $\mathbb{F}_4$ and then we study the properties of the code. Also, we find the number of additive Tridiagonal codes over $\mathbb{F}_4.$ Finally, we study the applications of Double-Tridiagonal codes to secret sharing scheme based on matrix projection.