Chinnappillai Durairajan

Orcid: 0000-0003-0235-3611

Affiliations:
  • Bharathidasan University, School of Mathematical Sciences, Tiruchirappalli, India


According to our database1, Chinnappillai Durairajan authored at least 20 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system.
Discret. Math. Algorithms Appl., October, 2023

2022
On some punctured codes of ℤq-Simplex codes.
Discret. Math. Algorithms Appl., 2022

2021
Codes from incidence matrices of some regular graphs.
Discret. Math. Algorithms Appl., 2021

Codes from incidence matrices of some Bouwer graphs.
Discret. Math. Algorithms Appl., 2021

Additive Tridiagonal Codes over F<sub>4</sub>.
CoRR, 2021

Bounds on r-identifying codes in q-ary Lee space.
Contributions Discret. Math., 2021

The t-wise intersection and trellis of relative four-weight codes.
Cryptogr. Commun., 2021

2020
Linear Codes from Incidence Matrices of Unit Graphs.
CoRR, 2020

Codes from the Incidence Matrices of a zero-divisor Graphs.
CoRR, 2020

Exponent of Cyclic Codes over F<sub>q</sub>.
CoRR, 2020

2019
r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube.
Discret. Math. Algorithms Appl., 2019

2017
On Codes over Z<sub>p<sup>2</sup></sub> and its Covering Radius.
CoRR, 2017

2016
Relative two-weight ℤ<sub>2</sub>ℤ<sub>4</sub>-additive Codes.
CoRR, 2016

The Structure of Z_2[u]Z_2[u, v]-additive Codes.
CoRR, 2016

2015
On the ℤ<sub>q</sub>-Simplex codes and its weight distribution for dimension 2.
Discret. Math. Algorithms Appl., 2015

On Various Parameters of Z<sub>q</sub>-Simplex codes for an even integer q.
CoRR, 2015

On the $Z_q$-MacDonald Code and its Weight Distribution of dimension 3.
CoRR, 2015

2014
On the covering radius of some modular codes.
Adv. Math. Commun., 2014

2003
A Note On Covering Radius Of Macdonald Codes.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

1996
A note on bounds for q-ary covering codes.
IEEE Trans. Inf. Theory, 1996


  Loading...