Anuradha Sharma

activity

20132019

most citedRepeated-root constacyclic codes over finite commutative chain rings and their distances

3 citations · 5 across the 4 of their papers we have counts for

collaborators

6 papers

cs.IT2019

On depth spectra of constacyclic codes

Tania Sidana

In this paper, we determine depth spectra of all repeated-root $(α + γ β)$ -constacyclic codes of arbitrary lengths over a finite commutative chain ring $R,$ where $α$ is a n…

math.AC2017

Multi-twisted codes over finite fields and their dual codes

Anuradha Sharma, Varsha Chauhan, Harshdeep Singh

Let $F_{q}$ denote the finite field of order $q,$ let $m_{1}, m_{2}, \dots, m_{ℓ}$ be positive integers satisfying $g cd (m_{i}, q) = 1$ for $1 \leq i \leq ℓ,$ and let $n=m_1+m_…

math.NT2017★ 1 cited

Repeated-root constacyclic codes over the finite chain ring $F_{p^{m}} [u] / ⟨ u^{3} ⟩$

Anuradha Sharma, Tania Sidana

Let $R = F_{p^{m}} [u] / ⟨ u^{3} ⟩$ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $F_{p^{m}}$ i…

math.AC2017★ 3 cited

Repeated-root constacyclic codes over finite commutative chain rings and their distances

Anuradha Sharma, Tania Sidana

Let $R_{e}$ be a finite commutative chain ring with nilpotency index $e \geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R}_…

math.CO2017

Enumeration of complementary-dual cyclic $F_{q}$ -linear $F_{q^{t}}$ -codes

Anuradha Sharma, Taranjot Kaur

Let $F_{q}$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \geq 2$ be an integer. In this paper, we enumerate all the complementary-du…

cs.CR2013★ 1 cited

An Approach Of Substitution Method Based On ASCII Codes In Encryption Technique

Avinash Sharma, Anurag Bhatnagar, Nikhar Tak +3

In poly alphabetic substitution the plain texts letters are enciphered differently according to their position. The name poly alphabetic suggests that there are more than one key s…