N. Annamalai
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
N. Annamalai has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Chinnappillai Durairajan
Department of Mathematics, School of Mathematical Sciences, Bharathidasan University, Tiruchirappalli 620024, Tamil Nadu, India
9 shared publications - Anandhu Mohan
Department of Computational Science and Humanities, Indian Institute of Information Technology Kottayam, Pala-686635, Kerala, India
1 shared publication
Latest Publications
- 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.
- Open Access
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(\mathbb{Z}_{n})$ with vertex set is $\mathbb{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 AccessLinear 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(\mathbb{Z}_{n})$ with vertex set is $\mathbb{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 Access
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 is the set of all non-zero zero-divisors of the ring $\mathbb{Z}_n$ and two distinct vertices being adjacent iff their product is zero over $\mathbb{Z}_n.$ The main parameters of the codes are obtained.Open AccessCodes 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 is the set of all non-zero zero-divisors of the ring $\mathbb{Z}_n$ and two distinct vertices being adjacent iff their product is zero over $\mathbb{Z}_n.$ The main parameters of the codes are obtained. - Open AccessOn Codes over $\mathbb{Z}_{p^2}$ and its Covering RadiusThis paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$Open AccessOn Codes over $\mathbb{Z}_{p^2}$ and its Covering RadiusThis paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$
- Open Access
Relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive Codes
In this paper, we study a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance $\mathbb{Z}_2 \mathbb{Z}_4$-additive code is a binary two-distance code and that the Gray image of a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive code, with nontrivial binary part, is a linear binary relative two-weight code. The structure of relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes are described. Finally, we discussed permutation automorphism group of a $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes.
Open AccessRelative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive Codes
In this paper, we study a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance $\mathbb{Z}_2 \mathbb{Z}_4$-additive code is a binary two-distance code and that the Gray image of a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive code, with nontrivial binary part, is a linear binary relative two-weight code. The structure of relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes are described. Finally, we discussed permutation automorphism group of a $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes.
- Open Access
The Structure of Z_2[u]Z_2[u, v]-additive Codes
In this paper, we study the algebraic structure of Z_2[u]Z_2[u, v]-additive codes which are Z_2[u, v]-submodules where u^2 = v^2 = 0 and uv = vu. In particular, we determine a Gray map from Z_2[u]Z_2 [u, v] to Z_2^{2{\alpha}+8\b{eta}} and study generator and parity check matrices for these codes. Further we study the structure of Z_2[u]Z_2[u, v]-additive cyclic codes and constacyclic codes.
Open AccessThe Structure of Z_2[u]Z_2[u, v]-additive Codes
In this paper, we study the algebraic structure of Z_2[u]Z_2[u, v]-additive codes which are Z_2[u, v]-submodules where u^2 = v^2 = 0 and uv = vu. In particular, we determine a Gray map from Z_2[u]Z_2 [u, v] to Z_2^{2{\alpha}+8\b{eta}} and study generator and parity check matrices for these codes. Further we study the structure of Z_2[u]Z_2[u, v]-additive cyclic codes and constacyclic codes.