Sourav Deb

I am currently working as a Ph.D. student in the Laboratory of Natural Information Processing, Dhirubhai Ambani Institute of Information and Communication Technology Gandhinagar, under the supervision of Prof. Manish K. Gupta. I am working on Codes over finite commutative rings and DNA codes. I am also interested in Post- Quantum Cryptography, Quantum codes, Commutative Algebra, and Combinatorics.
Before joining Research Program at DA-IICT, I joined the Department of Mathematics, Surya Sen Mahavidyalaya (under the University of North Bengal) as a Guest Faculty for August 2016 - July 2017.

EDUCATION

Pursuing Doctoral Degree in Algebraic Coding Theory at DAIICT Gandhinagar. Expected to receive the Doctoral degree by March 2023. Received Graduate and Post Graduate degrees in Mathematics in 2013 and 2015, respectively, from Visva Bharati, Santiniketan.

RESEARCH INTERESTS

Codes for DNA-based data storage systems, Elliptic curves over finite rings, Codes over finite commutative and non-commutative rings

Scopus Publications

On the classification of codes over non-unital ring of order 4
Sourav Deb, Isha Kikani, and Manish K. Gupta
World Scientific Pub Co Pte Ltd
In the last 60 years coding theory has been studied a lot over finite fields [Formula: see text] or commutative rings [Formula: see text] with unity. Although in [Formula: see text], a study on the classification of the rings (not necessarily commutative or ring with unity) of order [Formula: see text] had been presented, the construction of codes over non-commutative rings or non-commutative non-unital rings surfaced merely two years ago. In this letter, we extend the diverse research on exploring the codes over the non-commutative and non-unital ring [Formula: see text] by presenting the classification of optimal and nice codes of length [Formula: see text] over [Formula: see text], along with respective weight enumerators and complete weight enumerators.


Review the art of designing dna nanostructures with cad software
Martin Glaser, Sourav Deb, Florian Seier, Amay Agrawal, Tim Liedl, Shawn Douglas, Manish K. Gupta, and David M. Smith
MDPI AG
Since the arrival of DNA nanotechnology nearly 40 years ago, the field has progressed from its beginnings of envisioning rather simple DNA structures having a branched, multi-strand architecture into creating beautifully complex structures comprising hundreds or even thousands of unique strands, with the possibility to exactly control the positions down to the molecular level. While the earliest construction methodologies, such as simple Holliday junctions or tiles, could reasonably be designed on pen and paper in a short amount of time, the advent of complex techniques, such as DNA origami or DNA bricks, require software to reduce the time required and propensity for human error within the design process. Where available, readily accessible design software catalyzes our ability to bring techniques to researchers in diverse fields and it has helped to speed the penetration of methods, such as DNA origami, into a wide range of applications from biomedicine to photonics. Here, we review the historical and current state of CAD software to enable a variety of methods that are fundamental to using structural DNA technology. Beginning with the first tools for predicting sequence-based secondary structure of nucleotides, we trace the development and significance of different software packages to the current state-of-the-art, with a particular focus on programs that are open source.


On conflict free DNA codes
Krishna Gopal Benerjee, Sourav Deb, and Manish K. Gupta
Springer Science and Business Media LLC



On Some Universally Good Fractional Repetition Codes
Shreyansh A. Prajapati, Sourav Deb, and Manish K. Gupta
IEEE
Data storage in Distributed Storage Systems (DSS) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O in such systems. Advances in the construction of optimal Fractional Repetition (FR) codes, a smart replication of encoded packets on $n$ nodes which also provides optimized disk I/O and where a node failure can be repaired by contacting some specific set of nodes in the system, is in high demand. An attempt towards the construction of universally good FR codes using three different approaches is addressed in this work. In this paper, we present that the code constructed using the partial regular graph for heterogeneous DSS, where the number of packets on each node is different, is universally good. Further, we also encounter the list of parameters for which the ring construction and the $T$-construction results in universally good codes. In addition, we evaluate the FR code constructions meeting the minimum distance bound.

Publications

Deb, Sourav, Isha Kikani, and Manish K. Gupta. "On the Classification of Codes over Non-Unital Ring of Order 4." arXiv preprint arXiv:2208.08710 (2022).

Alahmadi, Adel, Krishna Gopal Benerjee, Sourav Deb, and Manish K. Gupta. "DNA Codes over the Ring $\mathbb {Z} _4+ w\mathbb {Z} _4$." arXiv preprint arXiv:2110.09089 (2021).

GRANT DETAILS

VecDNAStor: Archival Vector DNA Data Storage

Sponsoring Agency: Department of Science and Technology (DST), India and Deutscher Akademischer Austauschdienst (DAAD), Germany

PIs: Prof. Manish K Gupta and Prof. David M Smith

Duration: 2 years

Status: Ongoing

Industry, Institute, or Organisation Collaboration

DNA Nanodevices Unit, Fraunhofer Institute for Cell Therapy and Immunology(IZI), Leipzig, Germany