arXiv subjects

Manish K. Gupta

Publications and source records attributed to Manish K. Gupta.

32 records · Page 2Linked to original sources

arXiv2015

On Dress Codes with Flowers

Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.

cs.IT↗

arXiv2015

Natural Data Storage: A Review on sending Information from now to then via Nature

Digital data explosion drives a demand for robust and reliable data storage medium. Development of better digital storage device to accumulate Zetta bytes (1 ZB = $10^{21}$ bytes ) of data that will be generated in near future is a big challenge. Looking at limitations of present day digital storage devices, it will soon be a big challenge for data scientists to provide reliable. affordable and dense storage medium. As an alternative, researcher used natural medium of storage like DNA, bacteria and protein as information storage systems. This article discuss DNA based information storage system in detail along with an overview about bacterial and protein data storage systems.

cs.IT↗

arXiv2015

Tradeoff for Heterogeneous Distributed Storage Systems between Storage and Repair Cost

In this paper, we consider heterogeneous distributed storage systems (DSSs) having flexible reconstruction degree, where each node in the system has dynamic repair bandwidth and dynamic storage capacity. In particular, a data collector can reconstruct the file at time $t$ using some arbitrary nodes in the system and for a node failure the system can be repaired by some set of arbitrary nodes. Using $min$-$cut$ bound, we investigate the fundamental tradeoff between storage and repair cost for our model of heterogeneous DSS. In particular, the problem is formulated as bi-objective optimization linear programing problem. For an arbitrary DSS, it is shown that the calculated $min$-$cut$ bound is tight.

cs.IT↗

arXiv2014

Preserving photon qubits in an unknown quantum state with Knill Dynamical Decoupling - Towards an all optical quantum memory

The implementation of polarization-based quantum communication is limited by signal loss and decoherence caused by the birefringence of a single-mode fiber. We investigate the Knill dynamical decoupling scheme, implemented using half-wave plates, to minimize decoherence and show that a fidelity greater than $99\%$ can be achieved in absence of rotation error and fidelity greater than $96\%$ can be achieved in presence of rotation error. Such a scheme can be used to preserve any quantum state with high fidelity and has potential application for constructing all optical quantum delay line, quantum memory, and quantum repeater.

quant-ph↗

arXiv2014

On Octonary Codes and their Covering Radii

This paper introduces new reduction and torsion codes for an octonary code and determines their basic properties. These could be useful for the classification of self-orthogonal and self dual codes over $\mathbb{Z}_8$. We also focus our attention on covering radius problem of octonary codes. In particular, we determine lower and upper bounds of the covering radius of several classes of Repetition codes, Simplex codes of Type $α$ and Type $β$ and their duals, MacDonald codes, and Reed-Muller codes over $\mathbb{Z}_8$.

cs.IT↗

arXiv2014

Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity

The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. This paper proves the strong converse for entanglement-assisted capacity by a completely different approach and identifies a bound on the strong converse exponent for this task. Namely, we exploit the recent entanglement-assisted "meta-converse" theorem of Matthews and Wehner, several properties of the recently established sandwiched Renyi relative entropy (also referred to as the quantum Renyi divergence), and the multiplicativity of completely bounded $p$-norms due to Devetak et al. The proof here demonstrates the extent to which the Arimoto approach can be helpful in proving strong converse theorems, it provides an operational relevance for the multiplicativity result of Devetak et al., and it adds to the growing body of evidence that the sandwiched Renyi relative entropy is the correct quantum generalization of the classical concept for all $α>1$.

quant-ph↗

arXiv2014

DNACloud: A Potential Tool for storing Big Data on DNA

The term Big Data is usually used to describe huge amount of data that is generated by humans from digital media such as cameras, internet, phones, sensors etc. By building advanced analytics on the top of big data, one can predict many things about the user such as behavior, interest etc. However before one can use the data, one has to address many issues for big data storage. Two main issues are the need of large storage devices and the cost associated with it. Synthetic DNA storage seems to be an appropriate solution to address these issues of the big data. Recently in 2013, Goldman and his collegues from European Bioinformatics Institute demonstrated the use of the DNA as storage medium with capacity of storing 2.2 peta bytes of information on one gram of DNA and retrived the data successfully with low error rate. This significant step shows a promise for synthetic DNA storage as a useful technology for the future data storage. Motivated by this, we have developed a software called DNACloud which makes it easy to store the data on the DNA. In this work, we present detailed description of the software.

cs.ET↗

arXiv2013

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.

cs.DC↗

arXiv2013

Dynamical Decoupling in Optical Fibers: Preserving Polarization Qubits from Birefringent Dephasing

One of the major challenges in quantum computation has been to preserve the coherence of a quantum system against dephasing effects of the environment. The information stored in photon polarization, for example, is quickly lost due to such dephasing, and it is crucial to preserve the input states when one tries to transmit quantum information encoded in the photons through a communication channel. We propose a dynamical decoupling sequence to protect photonic qubits from dephasing by integrating wave plates into optical fiber at prescribed locations. We simulate random birefringent noise along realistic lengths of optical fiber and study preservation of polarization qubits through such fibers enhanced with Carr-Purcell-Meiboom-Gill (CPMG) dynamical decoupling. This technique can maintain photonic qubit coherence at high fidelity, making a step towards achieving scalable and useful quantum communication with photonic qubits.

quant-ph↗

arXiv2013

Reconstruction and Repair Degree of Fractional Repetition Codes

Given a Fractional Repetition code, finding the reconstruction and repair degree in a distributed storage system is an important problem. In this work, we present algorithms for computing the reconstruction and repair degree of fractional repetition codes.

cs.IT↗

arXiv2013

Enumerating Some Fractional Repetition Codes

In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node. To optimize other DSS parameters such as computation and disk I/O, Distributed Replication-based Simple Storage (Dress) Codes consisting of an inner Fractional Repetition (FR) code and an outer MDS code are commonly used. Thus constructing FR codes is an important research problem, and several constructions using graphs and designs have been proposed. In this paper, we present an algorithm for constructing the node-packet distribution matrix of FR codes and thus enumerate some FR codes up to a given number of nodes n. We also present algorithms for constructing regular graphs which give rise to FR codes.

cs.IT↗

arXiv2012

Biospectrogram: a tool for spectral analysis of biological sequences

Summary: Biospectrogam is an open-source software for the spectral analysis of DNA and protein sequences. The software can fetch (from NCBI server), import and manage biological data. One can analyze the data using Digital Signal Processing (DSP) techniques since the software allows the user to convert the symbolic data into numerical data using 23 popular encodings and then apply popular transformations such as Fast Fourier Transform (FFT) etc. and export it. The ability of exporting (both encoding files and transform files) as a MATLAB .m file gives the user an option to apply variety of techniques of DSP. User can also do window analysis (both sliding in forward and backward directions and stagnant) with different size windows and search for meaningful spectral pattern with the help of exported MATLAB file in a dynamic manner by choosing time delay in the plot using Biospectrogram. Random encodings and user choice encoding allows software to search for many possibilities in spectral space. Availability: Biospectrogam is written in Java and is available to download freely from http://www.guptalab.org/biospectrogram. Software has been optimized to run on Windows, Mac OSX and Linux. User manual and you-tube (product demo) tutorial is also available on the website. We are in the process of acquiring open source license for it.

q-bio.QM↗

arXiv2012

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.

cs.ET↗

arXiv2009

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.

cs.IT↗