default search action
Ritumoni Sarma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j11]Anuj Kumar Bhagat, Ritumoni Sarma
, Vidya Sagar:
Subfield codes of C-codes over F2[x]/〈x3-x〉. Discret. Math. 348(1): 114223 (2025) - [j10]Anuj Kumar Bhagat
Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials. Finite Fields Their Appl. 101: 102519 (2025) - 2024
- [j9]Vidya Sagar
Certain binary minimal codes constructed using simplicial complexes. Adv. Math. Commun. 18(2): 425-454 (2024) - [j8]Vidya Sagar
Minimal and optimal binary codes obtained using CD-construction over the non-unital ring I. Des. Codes Cryptogr. 92(1): 145-157 (2024) - [j7]Anuj Kumar Bhagat
F-valued trace of a finite-dimensional commutative F-algebra. Finite Fields Their Appl. 94: 102360 (2024) - [j6]Rajendra Kumar Sharma
Multisecret-sharing scheme with two-level security and its applications in blockchain. IET Blockchain 4(1): 30-42 (2024) - [j5]Vidya Sagar
Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes. IEEE Trans. Inf. Theory 70(5): 3373-3384 (2024) - [i8]Anuj Kumar Bhagat, Ritumoni Sarma, Vidya Sagar:
Subfield codes of CD-codes over F2[x]/〈x3-x〉 are really nice! CoRR abs/2402.10465 (2024) - 2023
- [j4]Vidya Sagar
Octanary linear codes using simplicial complexes. Cryptogr. Commun. 15(3): 599-616 (2023) - [j3]Vidya Sagar
ACD codes over $${\mathbb {Z}}_{2}{\mathcal {R}}$$ and the MacWilliams identities. J. Appl. Math. Comput. 69(1): 1221-1238 (2023) - [i7]Vidya Sagar, Ritumoni Sarma:
Codes over the non-unital non-commutative ring E using simplicial complexes. CoRR abs/2304.06758 (2023) - [i6]Vidya Sagar, Ritumoni Sarma:
Minimal and Optimal binary codes obtained using CD-construction over the non-unital ring I. CoRR abs/2305.08781 (2023) - [i5]Anuj Kumar Bhagat, Ritumoni Sarma:
F-valued trace of a finite-dimensional commutative F-algebra. CoRR abs/2309.09595 (2023) - 2022
- [j2]Xiangrui Meng, Vidya Sagar, Ritumoni Sarma:
Codes with low-dimensional hull. Int. J. Inf. Coding Theory 6(1): 71-86 (2022) - [i4]Vidya Sagar, Ritumoni Sarma:
Linear codes using simplicial complexes. CoRR abs/2204.08417 (2022) - [i3]Anuj Kumar Bhagat, Ritumoni Sarma:
On the exponent of cyclic codes. CoRR abs/2208.14287 (2022) - [i2]Rajendra Kumar Sharma, Ritumoni Sarma, Neha Arora, Vidya Sagar:
Multisecret-sharing scheme with two-level security and its applications in Blockchain. CoRR abs/2209.03670 (2022) - [i1]Vidya Sagar, Ritumoni Sarma:
Certain binary minimal codes constructed using simplicial complexes. CoRR abs/2211.15747 (2022)
2010 – 2019
- 2016
- [j1]Ritumoni Sarma, Seema Kushwaha:
On Finite Semi-regular Continued Fractions. Integers 16: A45 (2016)
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 21: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: