default search action
Anuradha Sharma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j49]Varsha Chauhan, Anuradha Sharma
:
Some new constructions of optimal and almost optimal locally repairable codes. Finite Fields Their Appl. 101: 102518 (2025) - 2024
- [j48]Monika Yadav
Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic. Des. Codes Cryptogr. 92(2): 303-339 (2024) - [j47]Monika Yadav, Anuradha Sharma
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. 347(1): 113717 (2024) - [j46]Sachin Pathak, Anuradha Sharma
On the hulls of cyclic codes of oddly even length over Z4. Discret. Math. 347(3): 113796 (2024) - [j45]Sandeep Sharma
Multi-twisted additive self-orthogonal and ACD codes are asymptotically good. Finite Fields Their Appl. 93: 102319 (2024) - [j44]Monika Yadav, Anuradha Sharma
Some new classes of additive MDS and almost MDS codes over finite fields. Finite Fields Their Appl. 95: 102394 (2024) - 2023
- [j43]Sandeep Sharma
Multi-twisted additive codes over finite fields are asymptotically good. Cryptogr. Commun. 15(1): 17-33 (2023) - [j42]Monika Yadav
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. 91(5): 1973-2003 (2023) - 2022
- [j41]Monika Yadav
On the enumeration and classification of σ-LCD codes over finite commutative chain rings. Discret. Math. 345(8): 112915 (2022) - [j40]Anuradha Sharma:
Reformulation of bilevel linear fractional/linear programming problem into a mixed integer programming problem via complementarity problem. Int. J. Comput. Sci. Math. 15(4): 359-370 (2022) - [j39]Varsha Chauhan, Anuradha Sharma
A generalization of multi-twisted codes over finite fields, their Galois duals and Type II codes. J. Appl. Math. Comput. 68(2): 1413-1447 (2022) - 2021
- [j38]Tania Sidana
Roulette games and depths of words over finite commutative rings. Des. Codes Cryptogr. 89(4): 641-678 (2021) - [j37]Varsha Chauhan, Anuradha Sharma
Hamming weight distributions of multi-twisted codes over finite fields. Des. Codes Cryptogr. 89(8): 1787-1837 (2021) - [j36]Monika Yadav
Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings. Discret. Math. 344(1): 112152 (2021) - [j35]Varsha Chauhan, Anuradha Sharma:
Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents. Finite Fields Their Appl. 76: 101910 (2021) - 2020
- [j34]Tania Sidana
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩. IEEE Access 8: 101320-101337 (2020)
2010 – 2019
- 2019
- [b1]Minjia Shi, YoungJu Choie, Anuradha Sharma, Patrick Solé:
Codes and Modular Forms - A Dictionary. WorldScientific 2019, ISBN 9789811212918, pp. 1-232 - [j33]Anuradha Sharma
Skew multi-twisted codes over finite fields and their Galois duals. Finite Fields Their Appl. 59: 297-334 (2019) - [j32]Anuradha Sharma
On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings. IEEE Trans. Inf. Theory 65(2): 1072-1084 (2019) - [j31]Anuradha Sharma
On b-Symbol Distances of Repeated-Root Constacyclic Codes. IEEE Trans. Inf. Theory 65(12): 7848-7867 (2019) - [c1]Anuradha Sharma, Abhilash Sonker
Benefaction of Digital Image Processing Techniques in Quality Assessment of Rose Flower. ICCCNT 2019: 1-5 - [i3]Anuradha Sharma, Tania Sidana:
On depth spectra of constacyclic codes over finite commutative chain rings. CoRR abs/1912.05815 (2019) - 2018
- [j30]Anuradha Sharma
Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1): 123-141 (2018) - [j29]Anuradha Sharma
Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields. Cryptogr. Commun. 10(3): 401-435 (2018) - [j28]Anuradha Sharma
Enumeration of complementary-dual cyclic Fq-linear Fqt-codes. Discret. Math. 341(4): 965-980 (2018) - [j27]Anuradha Sharma
Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2, m). Discret. Math. Algorithms Appl. 10(3): 1850036:1-1850036:22 (2018) - [j26]Anuradha Sharma
Multi-twisted codes over finite fields and their dual codes. Finite Fields Their Appl. 51: 270-297 (2018) - 2017
- [j25]Taranjot Kaur, Anuradha Sharma
Constacyclic additive codes over finite fields. Discret. Math. Algorithms Appl. 9(3): 1750037:1-1750037:35 (2017) - [j24]Anuradha Sharma, Taranjot Kaur:
On cyclic q-linear qt-codes. Int. J. Inf. Coding Theory 4(1): 19-46 (2017) - [j23]Anuradha Sharma, Amit K. Sharma:
Byte weight enumerators of codes over p and modular forms over a totally real field. Int. J. Inf. Coding Theory 4(4): 237-257 (2017) - [i2]Anuradha Sharma, Saroj Rani:
Constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$. CoRR abs/1707.06133 (2017) - 2016
- [j22]Anuradha Sharma, Suman Bala:
The weight distributions of some binary cyclic codes. Ars Comb. 126: 41-63 (2016) - [j21]Anuradha Sharma, Suman Bala:
On the weight distributions of some q-ary cyclic codes. Ars Comb. 128: 199-208 (2016) - [j20]Anuradha Sharma
Construction of self-dual codes over ℤ2m. Cryptogr. Commun. 8(1): 83-101 (2016) - [j19]Anuradha Sharma
On constacyclic codes over finite fields. Cryptogr. Commun. 8(4): 617-636 (2016) - [j18]Anuradha Sharma
Repeated-root constacyclic codes of length 4ℓmpn. Finite Fields Their Appl. 40: 163-200 (2016) - [j17]Anuradha Sharma:
On cyclic codes of length pnℓm over a finite field. Int. J. Inf. Coding Theory 3(3): 217-233 (2016) - 2015
- [j16]Anuradha Sharma
Repeated-root constacyclic codes of length ℓ t p s and their dual codes. Cryptogr. Commun. 7(2): 229-255 (2015) - [j15]Anuradha Sharma
Self-dual and self-orthogonal negacyclic codes of length 2mpn over a finite field. Discret. Math. 338(4): 576-592 (2015) - 2014
- [j14]Anuradha Sharma, Amit K. Sharma:
MacWilliams identities for m-spotty weight enumerators of codes over rings. Australas. J Comb. 58: 67-105 (2014) - [j13]Anuradha Sharma, Gurmeet K. Bakshi:
Polyadic codes of prime power length II. Ars Comb. 117: 9-31 (2014) - [j12]Anuradha Sharma
On some new m-spotty Lee weight enumerators. Des. Codes Cryptogr. 71(1): 119-152 (2014) - [j11]Amit K. Sharma
Macwilliams Identities for Weight enumerators with respect to the RT Metric. Discret. Math. Algorithms Appl. 6(2) (2014) - [j10]Anuradha Sharma, Amit K. Sharma
A note on weight distributions of irreducible cyclic codes. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j9]Anuradha Sharma
On a gg-fold joint mm-spotty Lee weight enumerator. Discret. Math. 313(20): 2150-2161 (2013) - [i1]Avinash Sharma, Anurag Bhatnagar, Nikhar Tak, Anuradha Sharma, Jitendra Avasthi, Prerna Sharma:
An Approach Of Substitution Method Based On ASCII Codes In Encryption Technique. CoRR abs/1302.4510 (2013) - 2012
- [j8]Anuradha Sharma
On MacWilliams type identities for r-fold joint m-spotty weight enumerators. Discret. Math. 312(22): 3316-3327 (2012) - [j7]Anuradha Sharma
The weight distribution of some irreducible cyclic codes. Finite Fields Their Appl. 18(1): 144-159 (2012) - [j6]Anuradha Sharma
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators. IEEE Trans. Inf. Theory 58(6): 3912-3924 (2012)
2000 – 2009
- 2008
- [j5]Anuradha Sharma, Gurmeet K. Bakshi, V. C. Dumir, Madhu Raka:
Irreducible Cyclic Codes of Length 2n. Ars Comb. 86 (2008) - 2007
- [j4]Anuradha Sharma, Gurmeet K. Bakshi, Madhu Raka:
Irreducible cyclic codes of length 2pn. Ars Comb. 83 (2007) - [j3]Anuradha Sharma
Polyadic codes of prime power length. Finite Fields Their Appl. 13(4): 1071-1085 (2007) - [j2]Anuradha Sharma
The weight distributions of irreducible cyclic codes of length 2m. Finite Fields Their Appl. 13(4): 1086-1095 (2007) - 2004
- [j1]Anuradha Sharma
Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(xpn-1). Finite Fields Their Appl. 10(4): 653-673 (2004)
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-11-07 20:33 CET 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: