default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatya Bagchi
Person information
- affiliation: NIT Durgapur, West Bengal, India
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Haradhan Ghosh
, Pramod Kumar Maurya, Satya Bagchi:
Secret sharing based RFID protocol using ECC for TMIS. Peer Peer Netw. Appl. 17(2): 624-638 (2024)- 2023
- [j12]Pramod Kumar Maurya, Haradhan Ghosh, Satya Bagchi:
MDS Code Based Ultralightweight Authentication Protocol for RFID System. IEEE Access 11: 10563-10577 (2023) - [j11]Haradhan Ghosh, Pramod Kumar Maurya, Satya Bagchi:
Linear complementary pair of codes based lightweight RFID protocol. Comput. Commun. 208: 79-88 (2023) - [j10]Sanjit Bhowmick, Satya Bagchi, Ramakrishna Bandi:
LCD matrix product codes with an application. Discret. Math. Algorithms Appl. 15(4): 2250104:1-2250104:17 (2023) - [j9]Pramod Kumar Maurya, Satya Bagchi:
Quadratic residue-based unilateral authentication protocol for RFID system. Multim. Tools Appl. 82(11): 16533-16554 (2023) - [c3]Haradhan Ghosh, Pramod Kumar Maurya, Satya Bagchi:
A Verifiable Secret Sharing Scheme using Elliptic Curve Cryptography. ICCCNT 2023: 1-6 - [c2]Deep Mukhopadhyay, Sanjit Bhowmick, Kalyan Hansda, Satya Bagchi:
Optimal Constructions of LRCs based on Cayley Table. ICCCNT 2023: 1-5 - 2022
- [c1]Deep Mukhopadhyay, Kalyan Hansda, Satya Bagchi:
Some Properties and Constructions of Weakly Self Dual LRCs. SPCOM 2022: 1-5 - [i9]Ankan Shaw, Sanjit Bhowmick, Satya Bagchi:
Classification and count of binary linear complementary dual group codes. CoRR abs/2201.08548 (2022) - 2021
- [i8]Haradhan Ghosh, Sanjit Bhowmick, Pramod Kumar Maurya, Satya Bagchi:
Linear complementary dual code-based Multi-secret sharing scheme. CoRR abs/2112.05469 (2021) - [i7]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
- [j8]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) - [j7]Pramod Kumar Maurya, Satya Bagchi:
Cyclic group based mutual authentication protocol for RFID system. Wirel. Networks 26(2): 1005-1015 (2020) - [j6]Kashi Nath Datta, Prithviraj Pramanik, Satya Bagchi, Subrata Nandi, Sujoy Saha:
Binary Galois field based asynchronous scheduling protocol for delay tolerant networks. Wirel. Networks 26(8): 5867-5882 (2020)
2010 – 2019
- 2019
- [j5]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) - [i6]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
- [j4]Pramod Kumar Maurya, Satya Bagchi:
A Secure PUF-Based Unilateral Authentication Scheme for RFID System. Wirel. Pers. Commun. 103(2): 1699-1712 (2018) - [i5]Pramod Kumar Maurya, Satya Bagchi:
Cyclic group based mutual authentication protocol for RFID system. CoRR abs/1801.00308 (2018) - [i4]Saikat Roy, Satya Bagchi:
On maximum distance separable group codes with complementary duals. CoRR abs/1801.00961 (2018) - [i3]Shyambhu Mukherjee, Joydeb Pal, Satya Bagchi:
On decoding procedures of intertwining codes. CoRR abs/1801.02010 (2018) - [i2]Sanjit Bhowmick, Satya Bagchi, Ramakrishna Bandi:
Self-dual cyclic codes over M2(ℤ4). CoRR abs/1807.04913 (2018) - 2017
- [j3]Pramod Kumar Maurya, Joydeb Pal, Satya Bagchi:
A Coding Theory Based Ultralightweight RFID Authentication Protocol with CRC. Wirel. Pers. Commun. 97(1): 967-976 (2017) - [i1]Joydeb Pal, Pramod Kumar Maurya, Shyambhu Mukherjee, Satya Bagchi:
Generalized twisted centralizer codes. CoRR abs/1709.01825 (2017) - 2014
- [j2]Manjusri Basu, Satya Bagchi, Debabrata Kumar Ghosh:
Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design. Inf. Sci. 278: 221-230 (2014)
2000 – 2009
- 2009
- [j1]Manjusri Basu, Md. M. Rahaman, Satya Bagchi:
On a new code, [2n-1, n, 2n-1]. Discret. Appl. Math. 157(2): 402-405 (2009)
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-10-07 22:10 CEST 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:
