Manish. K. Gupta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Manish. K. Gupta has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Abhishek Chhajer
Dhirubhai Ambani Institute of Information and Communication Technology Laboratory of Natural Information Processing Post Bag Number 4 Near Indroda Circle 382007 Gandhinagar Gujarat India
1 shared publicationAkshita Sahai
Dhirubhai Ambani Institute of Information and Communication Technology Laboratory of Natural Information Processing
1 shared publicationAnshul Chaurasia
Dhirubhai Ambani Institute of Information and Communication Technology Laboratory of Natural Information Processing Post Bag Number 4 Near Indroda Circle 382007 Gandhinagar Gujarat India
1 shared publication- Arbind Kumar Lal
IIT Kanpur
1 shared publication Arnav Goyal
Dhirubhai Ambani Institute of Information and Communication Technology Laboratory of Natural Information Processing
1 shared publication- C. Durairajan
Department of Mathematics School of Mathematical Sciences Bharathidasan University Tiruchirappalli Tamil 620 024 Nadu India
1 shared publication
Latest Publications
- Open Access
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 8 (2) , 129-137
On the covering radius of some modular codes
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\mathbb{Z}_4$.- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 8 (2) , 129-137
Open AccessOn the covering radius of some modular codes
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\mathbb{Z}_4$. - Open Access
Quorum Sensing for Regenerating Codes in Distributed Storage
Distributed storage systems with replication are well known for storing large amount of data. A large number of replication is done in order to provide reliability. This makes the system expensive. Various methods have been proposed over time to reduce the degree of replication and yet provide same level of reliability. One recently suggested scheme is of Regenerating codes, where a file is divided in to parts which are then processed by a coding mechanism and network coding to provide large number of parts. These are stored at various nodes with more than one part at each node. These codes can generate whole file and can repair a failed node by contacting some out of total existing nodes. This property ensures reliability in case of node failure and uses clever replication. This also optimizes bandwidth usage. In a practical scenario, the original file will be read and updated many times. With every update, we will have to update the data stored at many nodes. Handling multiple requests at the same time will bring a lot of complexity. Reading and writing or multiple writing on the same data at the same time should also be prevented. In this paper, we propose an algorithm that manages and executes all the requests from the users which reduces the update complexity. We also try to keep an adequate amount of availability at the same time. We use a voting based mechanism and form read, write and repair quorums. We have also done probabilistic analysis of regenerating codes.
Open AccessQuorum Sensing for Regenerating Codes in Distributed Storage
Distributed storage systems with replication are well known for storing large amount of data. A large number of replication is done in order to provide reliability. This makes the system expensive. Various methods have been proposed over time to reduce the degree of replication and yet provide same level of reliability. One recently suggested scheme is of Regenerating codes, where a file is divided in to parts which are then processed by a coding mechanism and network coding to provide large number of parts. These are stored at various nodes with more than one part at each node. These codes can generate whole file and can repair a failed node by contacting some out of total existing nodes. This property ensures reliability in case of node failure and uses clever replication. This also optimizes bandwidth usage. In a practical scenario, the original file will be read and updated many times. With every update, we will have to update the data stored at many nodes. Handling multiple requests at the same time will bring a lot of complexity. Reading and writing or multiple writing on the same data at the same time should also be prevented. In this paper, we propose an algorithm that manages and executes all the requests from the users which reduces the update complexity. We also try to keep an adequate amount of availability at the same time. We use a voting based mechanism and form read, write and repair quorums. We have also done probabilistic analysis of regenerating codes.
- Open Access
DNA Pen: A Tool for Drawing on a Molecular Canvas
DNA origami is an interdisciplinary area where DNA can be used as a building block for making useful stuff at nanoscale. This work presents an open source software DNA pen (based on the recent work of Peng Yin and his group) which can be used (using free hand and digital molecular canvas) to draw an object at nanoscale. Software generates error free DNA sequences which can be used in the wet lab to create the object at the nanoscale. Using DNA pen we have drawn several objects including the map of India and sanskrit letter "Om" from free hand molecular canvas and digital letter DNA using digitized molecular canvas.
Open AccessDNA Pen: A Tool for Drawing on a Molecular Canvas
DNA origami is an interdisciplinary area where DNA can be used as a building block for making useful stuff at nanoscale. This work presents an open source software DNA pen (based on the recent work of Peng Yin and his group) which can be used (using free hand and digital molecular canvas) to draw an object at nanoscale. Software generates error free DNA sequences which can be used in the wet lab to create the object at the nanoscale. Using DNA pen we have drawn several objects including the map of India and sanskrit letter "Om" from free hand molecular canvas and digital letter DNA using digitized molecular canvas.
- Open Access
Modular Arithmetic Expressions and Primality Testing via DNA Self-Assembly
Self-assembly is a fundamental process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. Algorithms for solving many mathematical and computational problems via tile self assembly have been proposed by many researchers in the last decade. In particular tile set for doing basic arithmetic of two inputs have been given. In this work we give tile set for doing basic arithmetic (addition, subtraction, multiplication) of n inputs and subsequently computing its modulo. We also present a tile set for primality testing. Finally we present a software 'xtilemod' for doing modular arithmetic. This simplifies the task of creating the input files to xgrow simulator for doing basic (addition, subtraction, multiplication and division) as well as modular arithmetic of n inputs. Similar software for creating tile set for primality testing is also given.
Open AccessModular Arithmetic Expressions and Primality Testing via DNA Self-Assembly
Self-assembly is a fundamental process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. Algorithms for solving many mathematical and computational problems via tile self assembly have been proposed by many researchers in the last decade. In particular tile set for doing basic arithmetic of two inputs have been given. In this work we give tile set for doing basic arithmetic (addition, subtraction, multiplication) of n inputs and subsequently computing its modulo. We also present a tile set for primality testing. Finally we present a software 'xtilemod' for doing modular arithmetic. This simplifies the task of creating the input files to xgrow simulator for doing basic (addition, subtraction, multiplication and division) as well as modular arithmetic of n inputs. Similar software for creating tile set for primality testing is also given.
- Open Access
On the Covering Radius of Some Modular Codes
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.Open AccessOn the Covering Radius of Some Modular Codes
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$. - Open Access
XTile: An Error-Correction Package for DNA Self-Assembly
Self assembly is a process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. It has been predicted that in future self assembly will become an important engineering discipline by combining the fields of bio molecular computation, nano technology and medicine. However error control is a key challenge in realizing the potential of self assembly. Recently many authors have proposed several combinatorial error correction schemes to control errors which have a close analogy with the coding theory such as Winfree s proofreading scheme and its generalizations by Chen and Goel and compact scheme of Reif, Sahu and Yin. In this work, we present an error correction computational tool XTile that can be used to create input files to the Xgrow simulator of Winfree by providing the design logic of the tiles and it also allows the user to apply proofreading, snake and compact error correction schemes.
Open AccessXTile: An Error-Correction Package for DNA Self-Assembly
Self assembly is a process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. It has been predicted that in future self assembly will become an important engineering discipline by combining the fields of bio molecular computation, nano technology and medicine. However error control is a key challenge in realizing the potential of self assembly. Recently many authors have proposed several combinatorial error correction schemes to control errors which have a close analogy with the coding theory such as Winfree s proofreading scheme and its generalizations by Chen and Goel and compact scheme of Reif, Sahu and Yin. In this work, we present an error correction computational tool XTile that can be used to create input files to the Xgrow simulator of Winfree by providing the design logic of the tiles and it also allows the user to apply proofreading, snake and compact error correction schemes.
- 28 August 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (16) , 1871-1880
Linear transformations on codes
- 28 August 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (16) , 1871-1880
Linear transformations on codes
- 23 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Engineering in Medicine and Biology Magazine
- Vol. 25 (1) , 46-53
The quest for error correction in biology
The goal of this article is to give a brief account of the recent developments in codes and biology. With the increasing understanding of biology and with the advancement of sequencing technology, the whole human genome is stretched out before us. There is a need to look again with these new information for the applications of coding and information theory to biology. This paper focuses on the existence of error correction in biological information processing.
- 23 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Engineering in Medicine and Biology Magazine
- Vol. 25 (1) , 46-53
The quest for error correction in biology
The goal of this article is to give a brief account of the recent developments in codes and biology. With the increasing understanding of biology and with the advancement of sequencing technology, the whole human genome is stretched out before us. There is a need to look again with these new information for the applications of coding and information theory to biology. This paper focuses on the existence of error correction in biological information processing.
- 1 September 2005
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 36 (3) , 227-244
On Linear Codes over ${\mathbb{Z}}_{2^{s}}$- 1 September 2005
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 36 (3) , 227-244
On Linear Codes over ${\mathbb{Z}}_{2^{s}}$