Anuradha Sharma

Orcid: 0000-0002-0133-8658

According to our database1, Anuradha Sharma authored at least 54 papers between 2004 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Some new constructions of optimal and almost optimal locally repairable codes.
Finite Fields Their Appl., 2025

2024
On the hulls of cyclic codes of oddly even length over Z4.
Discret. Math., March, 2024

Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic.
Des. Codes Cryptogr., February, 2024

Multi-twisted additive self-orthogonal and ACD codes are asymptotically good.
Finite Fields Their Appl., January, 2024

Corrigendum to: "Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings" [Discrete Math. 344 (1) (2021) 112152].
Discret. Math., January, 2024

Some new classes of additive MDS and almost MDS codes over finite fields.
Finite Fields Their Appl., 2024

2023
A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring $\mathbb {F}_{2^r}[u]/$.
Des. Codes Cryptogr., May, 2023

Multi-twisted additive codes over finite fields are asymptotically good.
Cryptogr. Commun., 2023

2022
A generalization of multi-twisted codes over finite fields, their Galois duals and Type II codes.
J. Appl. Math. Comput., April, 2022

Reformulation of bilevel linear fractional/linear programming problem into a mixed integer programming problem via complementarity problem.
Int. J. Comput. Sci. Math., 2022

On the enumeration and classification of <i>σ</i>-LCD codes over finite commutative chain rings.
Discret. Math., 2022

2021
Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents.
Finite Fields Their Appl., 2021

Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings.
Discret. Math., 2021

Roulette games and depths of words over finite commutative rings.
Des. Codes Cryptogr., 2021

Hamming weight distributions of multi-twisted codes over finite fields.
Des. Codes Cryptogr., 2021

2020
Repeated-Root Constacyclic Codes Over the Chain Ring F<sub>p<sup>m</sup></sub>[u]/⟨u<sup>3</sup>⟩.
IEEE Access, 2020

2019
On b-Symbol Distances of Repeated-Root Constacyclic Codes.
IEEE Trans. Inf. Theory, 2019

On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings.
IEEE Trans. Inf. Theory, 2019

Skew multi-twisted codes over finite fields and their Galois duals.
Finite Fields Their Appl., 2019

On depth spectra of constacyclic codes over finite commutative chain rings.
CoRR, 2019

Benefaction of Digital Image Processing Techniques in Quality Assessment of Rose Flower.
Proceedings of the 10th International Conference on Computing, 2019

Codes and Modular Forms - A Dictionary
WorldScientific, ISBN: 9789811212932, 2019

2018
Multi-twisted codes over finite fields and their dual codes.
Finite Fields Their Appl., 2018

Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2, m).
Discret. Math. Algorithms Appl., 2018

Enumeration of complementary-dual cyclic Fq-linear Fqt-codes.
Discret. Math., 2018

Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields.
Cryptogr. Commun., 2018

Trace description and Hamming weights of irreducible constacyclic codes.
Adv. Math. Commun., 2018

2017
Byte weight enumerators of codes over <sub>p</sub> and modular forms over a totally real field.
Int. J. Inf. Coding Theory, 2017

On cyclic <sub>q</sub>-linear <sub>q<sup>t</sup></sub>-codes.
Int. J. Inf. Coding Theory, 2017

Constacyclic additive codes over finite fields.
Discret. Math. Algorithms Appl., 2017

Constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$.
CoRR, 2017

2016
On cyclic codes of length p<sup>n</sup>ℓ<sup>m</sup> over a finite field.
Int. J. Inf. Coding Theory, 2016

Repeated-root constacyclic codes of length 4ℓ<sup>m</sup>p<sup>n</sup>.
Finite Fields Their Appl., 2016

Construction of self-dual codes over ℤ<sub>2<sup>m</sup></sub>.
Cryptogr. Commun., 2016

On constacyclic codes over finite fields.
Cryptogr. Commun., 2016

On the weight distributions of some q-ary cyclic codes.
Ars Comb., 2016

The weight distributions of some binary cyclic codes.
Ars Comb., 2016

2015
Self-dual and self-orthogonal negacyclic codes of length 2<sup>m</sup>p<sup>n</sup> over a finite field.
Discret. Math., 2015

Repeated-root constacyclic codes of length ℓ t p s and their dual codes.
Cryptogr. Commun., 2015

2014
A note on weight distributions of irreducible cyclic codes.
Discret. Math. Algorithms Appl., 2014

Macwilliams Identities for Weight enumerators with respect to the RT Metric.
Discret. Math. Algorithms Appl., 2014

On some new m-spotty Lee weight enumerators.
Des. Codes Cryptogr., 2014

Polyadic codes of prime power length II.
Ars Comb., 2014

MacWilliams identities for m-spotty weight enumerators of codes over rings.
Australas. J Comb., 2014

2013
On a <i>g</i>g-fold joint <i>m</i>m-spotty Lee weight enumerator.
Discret. Math., 2013

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

2012
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators.
IEEE Trans. Inf. Theory, 2012

The weight distribution of some irreducible cyclic codes.
Finite Fields Their Appl., 2012

On MacWilliams type identities for r-fold joint m-spotty weight enumerators.
Discret. Math., 2012

2008
Irreducible Cyclic Codes of Length 2n.
Ars Comb., 2008

2007
The weight distributions of irreducible cyclic codes of length 2<sup>m</sup>.
Finite Fields Their Appl., 2007

Polyadic codes of prime power length.
Finite Fields Their Appl., 2007

Irreducible cyclic codes of length 2pn.
Ars Comb., 2007

2004
Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(x<sup>p<sup>n</sup></sup>-1).
Finite Fields Their Appl., 2004


  Loading...