default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChinnappillai Durairajan
Person information
- affiliation: Bharathidasan University, School of Mathematical Sciences, Tiruchirappalli, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]B. Rega, Chinnappillai Durairajan:
A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system. Discret. Math. Algorithms Appl. 15(7): 2250149:1-2250149:6 (2023)- 2022
- [j9]J. Prabu, J. Mahalakshmi, C. Durairajan, S. Santhakumar
:
On some punctured codes of ℤq-Simplex codes. Discret. Math. Algorithms Appl. 14(6): 2250012:1-2250012:26 (2022) - 2021
- [j8]B. Rega, Z. H. Liu, C. Durairajan:
The t-wise intersection and trellis of relative four-weight codes. Cryptogr. Commun. 13(2): 197-223 (2021) - [j7]Dhanalakshmi Ramalingam, Chinnappillai Durairajan:
Bounds on r-identifying codes in q-ary Lee space. Contributions Discret. Math. 16(1): 53-71 (2021) - [j6]R. Saranya, C. Durairajan:
Codes from incidence matrices of some Bouwer graphs. Discret. Math. Algorithms Appl. 13(3): 2150027:1-2150027:15 (2021) - [j5]R. Saranya, C. Durairajan:
Codes from incidence matrices of some regular graphs. Discret. Math. Algorithms Appl. 13(4): 2150035:1-2150035:17 (2021) - [i10]N. Annamalai, Anandhu Mohan, C. Durairajan:
Additive Tridiagonal Codes over F4. CoRR abs/2104.05405 (2021) - 2020
- [i9]N. Annamalai, Chinnappillai Durairajan:
Exponent of Cyclic Codes over Fq. CoRR abs/2009.11607 (2020) - [i8]N. Annamalai, C. Durairajan:
Codes from the Incidence Matrices of a zero-divisor Graphs. CoRR abs/2011.01602 (2020) - [i7]N. Annamalai, C. Durairajan:
Linear Codes from Incidence Matrices of Unit Graphs. CoRR abs/2011.04914 (2020)
2010 – 2019
- 2019
- [j4]R. Dhanalakshmi, C. Durairajan:
r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube. Discret. Math. Algorithms Appl. 11(2): 1950027:1-1950027:14 (2019) - 2017
- [i6]N. Annamalai, C. Durairajan:
On Codes over Zp2 and its Covering Radius. CoRR abs/1711.01803 (2017) - 2016
- [i5]N. Annamalai, C. Durairajan:
The Structure of Z_2[u]Z_2[u, v]-additive Codes. CoRR abs/1601.04859 (2016) - [i4]N. Annamalai, C. Durairajan:
Relative two-weight ℤ2ℤ4-additive Codes. CoRR abs/1609.09669 (2016) - 2015
- [j3]Chinnappillai Durairajan, J. Mahalakshmi, P. Chella Pandian:
On the ℤq-Simplex codes and its weight distribution for dimension 2. Discret. Math. Algorithms Appl. 7(3): 1550030:1-1550030:10 (2015) - [i3]P. Chella Pandian, C. Durairajan:
On Various Parameters of Zq-Simplex codes for an even integer q. CoRR abs/1503.05704 (2015) - [i2]J. Mahalakshmi, C. Durairajan:
On the $Z_q$-MacDonald Code and its Weight Distribution of dimension 3. CoRR abs/1505.05642 (2015) - 2014
- [j2]Manish K. Gupta, Chinnappillai Durairajan:
On the covering radius of some modular codes. Adv. Math. Commun. 8(2): 129-137 (2014) - 2012
- [i1]Manish K. Gupta, C. Durairajan:
On the Covering Radius of Some Modular Codes. CoRR abs/1206.3038 (2012)
2000 – 2009
- 2003
- [c1]Mahesh C. Bhandari, C. Durairajan:
A Note On Covering Radius Of Macdonald Codes. ITCC 2003: 221-225
1990 – 1999
- 1996
- [j1]Mahesh C. Bhandari, C. Durairajan:
A note on bounds for q-ary covering codes. IEEE Trans. Inf. Theory 42(5): 1640-1642 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
