Chinnappillai Durairajan

Chinnappillai Durairajan

Auto-generated profile, based on publicly available information

Chinnappillai Durairajan

Department of Mathematics, School of Mathematical Sciences, Bharathidasan University, Tiruchirappalli 620024, Tamil Nadu, India

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
1 January 2014 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
MGManish K. Gupta
Manish K. Gupta
CDChinnappillai Durairajan
Chinnappillai Durairajan
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\mathbb{Z}_4$.

1 September 1996 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBM.C. Bhandari
M.C. Bhandari
CDC. Durairajan
C. Durairajan

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

17 November 2021 in Journal of Information and Optimization Sciences
Verified
Journal Article
Closed access
NAN. Annamalai
N. Annamalai
CDC. Durairajan
C. Durairajan
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.

5 March 2020 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
RSR. Saranya
R. Saranya
CDC. Durairajan
C. Durairajan
We examine the p-ary linear codes from incidence matrix of the (n, k)-arrangement graphs for k = 2, n –2, n – 1. All the main parameters of the codes are obtained as respectively. We examine also the p-ary linear codes from incidence matrix of graphs such as Ljubljana graph, Heawood graph and the main parameters of the codes are [168, 111, 3]p, [21, 13, 3]p respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding.

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 .