DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint.
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.
13 October 2020 in Cryptography and Communications
DNA based storage systems received attention by many researchers in the last few years. This includes archival and re-writable (random access) DNA based storage systems. In this work, we have developed an efficient technique to encode the data into the DNA sequences using non-linear family of ternary codes. In particular, we propose an algorithm to encode data into DNA with high information storage density for archival storage using the sub-code of the Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA using our method.
Cognitive radio (CR) has emerged as a promising solution to the spectrum scarcity problem, faced by all existing as well as newly proposed wireless services. In cognitive radio network (CRN) spectrum sensing plays the most important role and is considered as an integral part of CR. Among all the spectrum sensing schemes proposed in literature energy detection (ED) is commonly adopted due to its low complexity. But for low signal to noise ratio (SNR) region the performance of ED scheme deteriorates. To enhance the sensing performance of ED scheme for low SNR region, an adaptive threshold is considered in this paper. This adaptive threshold is a function of fixed (conventional) threshold and SNR of primary user (PU) signal received at CR. However the individual CR node may not give valid sensing results due to shadowing, multipath fading and hidden terminal problems of wireless communication channel. Therefore to deal with these problems we further implement the proposed approach under cooperation. In cooperative spectrum sensing (CSS) scheme, each CR will individually sense the spectrum using adaptive threshold and then transfer its decision to a central node also known as fusion center (FC). All the binary decisions received at FC are fused together and then final decision about the availability of spectrum is taken by FC. The simulation results show the better performance of adaptive threshold under cooperation than non-cooperation.
1 January 2021 in Problems of Information Transmission
We consider heterogeneous distributed storage systems (DSSs) having flexible reconstruction degree, where each node in the system has nonuniform repair bandwidth and nonuniform storage capacity. In particular, a data collector can reconstruct the file using some \(k\) nodes in the system and, for a node failure, the system can be repaired by some set of active nodes. Using min-cut bound, we investigate the fundamental trade-off between storage and repair costs for our model of the heterogeneous DSS. Further, the problem is formulated as bi-objective optimization linear programing problem for various heterogeneous DSSs. For some DSSs, it is shown that the calculated min-cut bound is tight.