default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjit Bhowmick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Sanjit Bhowmick, Alexandre Fotue Tabue, Joydeb Pal
:
On the ℓ-DLIPs of codes over finite commutative rings. Discret. Math. 347(4): 113853 (2024)- [j6]Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager:
On linear complementary pairs of algebraic geometry codes over finite fields. Discret. Math. 347(12): 114193 (2024) - [j5]Sanjit Bhowmick, Xiusheng Liu:
Linear complementary pairs of codes over a finite non-commutative Frobenius ring. J. Appl. Math. Comput. 70(5): 4923-4936 (2024) - [i10]Sanjit Bhowmick, Deepak Kumar Dalai:
Additive Complementary Pairs of Codes. CoRR abs/2404.13249 (2024) - [i9]Sanjit Bhowmick, Xiusheng Liu:
Linear complementary pairs of codes over a finite non-commutative Frobenius ring. CoRR abs/2406.15794 (2024) - 2023
- [j4]Sanjit Bhowmick, Satya Bagchi, Ramakrishna Bandi:
LCD matrix product codes with an application. Discret. Math. Algorithms Appl. 15(4): 2250104:1-2250104:17 (2023) - [c1]Deep Mukhopadhyay, Sanjit Bhowmick, Kalyan Hansda, Satya Bagchi:
Optimal Constructions of LRCs based on Cayley Table. ICCCNT 2023: 1-5 - [i8]Sanjit Bhowmick, Javier de la Cruz, Edgar Martínez-Moro:
On LCP and checkable group codes over finite non-commutative Frobenius rings. CoRR abs/2303.18194 (2023) - [i7]Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager:
On Linear Complementary Pairs of Algebraic Geometry Codes over Finite Fields. CoRR abs/2311.01008 (2023) - 2022
- [i6]Ankan Shaw, Sanjit Bhowmick, Satya Bagchi:
Classification and count of binary linear complementary dual group codes. CoRR abs/2201.08548 (2022) - [i5]Sanjit Bhowmick, Alexandre Fotue Tabue, Joydeb Pal:
On the linear 𝓁-intersection pair of codes over a finite principal ideal ring. CoRR abs/2204.00905 (2022) - 2021
- [i4]Haradhan Ghosh, Sanjit Bhowmick, Pramod Kumar Maurya, Satya Bagchi:
Linear complementary dual code-based Multi-secret sharing scheme. CoRR abs/2112.05469 (2021) - [i3]Deep Mukhopadhyay, Sanjit Bhowmick, Kalyan Hansda, Satya Bagchi:
A Class of (n, k, r, t) IS-LRCs Via Parity Check Matrix. CoRR abs/2112.05474 (2021) - 2020
- [j3]Sanjit Bhowmick, Alexandre Fotue Tabue, Edgar Martínez-Moro, Ramakrishna Bandi, Satya Bagchi:
Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88(5): 825-840 (2020)
2010 – 2019
- 2019
- [j2]Joydeb Pal, Sanjit Bhowmick, Satya Bagchi:
Cyclic codes over $${\mathcal {M}}_4({\mathbb {F}}_2$$ M 4 ( F 2 ). J. Appl. Math. Comput. 60(1-2): 749-756 (2019) - [i2]Sanjit Bhowmick, Alexandre Fotue Tabue, Edgar Martínez-Moro, Ramakrishna Bandi, Satya Bagchi:
Do non-free LCD codes over finite commutative Frobenius rings exist? CoRR abs/1901.10836 (2019) - 2018
- [j1]Sanghita Mridha, Mageshwari Komarasamy, Sanjit Bhowmick, Rajiv S. Mishra, Sundeep Mukherjee:
Small-Scale Plastic Deformation of Nanocrystalline High Entropy Alloy. Entropy 20(11): 889 (2018) - [i1]Sanjit Bhowmick, Satya Bagchi, Ramakrishna Bandi:
Self-dual cyclic codes over M2(ℤ4). CoRR abs/1807.04913 (2018)
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 2025-01-20 23:03 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:
