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

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

collaborators

14 papers

math.CO2026

Subgroup perfect codes of in Cayley graphs

Ankan Shaw, Shibesh Kotal, Satya Bagchi

A perfect code in a graph is a subset of such that no two vertices in are adjacent and every vertex in is adjacent to exactly one vertex in…

math.CO2025

Subgroup perfect codes of in Cayley sum graphs

Ankan Shaw, Biswajit Mondal, Satya Bagchi

A perfect code in a graph is a subset of such that no two vertices in are adjacent, and every vertex in is adjacent to exactly one vertex in…

cs.IT2022

Classification and count of binary linear complementary dual group codes

Ankan Shaw, Sanjit Bhowmick, Satya Bagchi

We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cycl…

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…

cs.IT2021

A Class of LRCs Via Parity Check Matrix

Deep Mukhopadhyay, Sanjit Bhowmick, Kalyan Hansda +1

A code is called information symbol locally repairable code \big( LRC\big) if each information coordinate can be achieved by at least disjoint re…

math.FA2021

Birkhoff-James orthogonality in complex Banach spaces and Bhatia-Šemrl Theorem revisited

Saikat Roy, Satya Bagchi, Debmalya Sain

We explore Birkhoff-James orthogonality of two elements in a complex Banach space by using the directional approach. Our investigation illustrates the geometric distinctions betwee…