◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Satya Bagchi

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 2 papers where every author was matched, so the position is known.

fields
  • cs.CR1
  • math.CO1
ORCID 0000-0001-7588-9973

identity via Semantic Scholar / OpenAlex

most citedLinear complementary dual code-based Multi-secret sharing scheme

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2025

Subgroup perfect codes of Sn​ in Cayley sum graphs

Ankan Shaw, Biswajit Mondal, Satya Bagchi

A perfect code in a graph Γ=(V,E) is a subset C of V such that no two vertices in C are adjacent, and every vertex in V∖C is adjacent to exactly one vertex in…

cs.CR2021★ 1 cited

Linear complementary dual code-based Multi-secret sharing scheme

Haradhan Ghosh, Sanjit Bhowmick, Pramod Kumar Maurya +1

Hiding a secret is needed in many situations. Secret sharing plays an important role in protecting information from getting lost, stolen, or destroyed and has been applicable in re…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.