activity
20172022
most citedOn Codes over and its Covering Radius

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2022

Minimum Roman Dominating Distance Energy of a Graph

Lakshmanan R, N. Annamalai

In this correspondence, we introduced the concept of minimum roman dominating distance energy of a graph and computed minimum roman dominating distance energy of s…

cs.IT2021

Additive Tridiagonal Codes over

N. Annamalai, Anandhu Mohan, C. Durairajan

In this paper, we introduce a additive Tridiagonal and Double-Tridiagonal codes over and then we study the properties of the code. Also, we find the number of additi…

cs.IT2020

Linear Codes from Incidence Matrices of Unit Graphs

N. Annamalai, C Durairajan

In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph with vertex set is and t…

cs.IT20201 cited

Codes from the Incidence Matrices of a zero-divisor Graphs

N. Annamalai, C Durairajan

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 is the set of all non-zero zero-div…

cs.IT2020

Exponent of Cyclic Codes over

N. Annamalai, C. Durairajan

In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field We give a relation between the exponent of a cyclic code an…

cs.IT20171 cited

On Codes over and its Covering Radius

N. Annamalai, C. Durairajan

This paper gives lower and upper bounds on the covering radius of codes over with respect to Lee distance. We also determine the covering radius of various Repet…