English
Related papers

Related papers: Properties and constructions of constrained codes …

200 papers

We study the combination of two recent coding approaches, in the context of DNA based data storage. Composite DNA alphabets leverage properties of the DNA synthesis and sequencing process. A composite symbol does not represent a single…

Information Theory · Computer Science 2026-05-20 Tomer Cohen , Eitan Yaakobi , Zohar Yakhini

The problem of fast items retrieval from a fixed collection is often encountered in most computer science areas, from operating system components to databases and user interfaces. We present an approach based on hash tables that focuses on…

Neural and Evolutionary Computing · Computer Science 2020-07-17 Dan Domnita , Ciprian Oprisa

Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…

Rings and Algebras · Mathematics 2018-04-04 Ted Hurley

In this paper, we consider the outer channel for DNA-based data storage. When transmitting over the outer channel, each DNA string is treated as a unit/symbol that would be either correctly received, or erased, or corrupted by uniformly…

Information Theory · Computer Science 2025-09-23 Xuan He , Yi Ding , Kui Cai , Guanghui Song , Bin Dai , Xiaohu Tang

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

In this paper, we study the Random Access Problem in DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this framework, the data is represented by $k$ information…

Information Theory · Computer Science 2025-08-26 Avital Boruchovsky , Ohad Elishco , Ryan Gabrys , Anina Gruica , Itzhak Tamo , Eitan Yaakobi

This work presents a theoretical analysis of the probability of successfully retrieving data encoded with MDS codes (e.g., Reed-Solomon codes) in DNA storage systems. We study this probability under independent and identically distributed…

Information Theory · Computer Science 2026-05-08 Serge Kas Hanna

In order to survive, reproduce and (in multicellular organisms) differentiate, cells must control the concentrations of the myriad different proteins that are encoded in the genome. The precision of this control is limited by the inevitable…

Molecular Networks · Quantitative Biology 2013-08-01 Gasper Tkacik , Aleksandra M. Walczak , William Bialek

The pivotal storage density win achieved by solid-state devices over magnetic devices in 2015 is a result of multiple innovations in physics, architecture, and signal processing. One of the most important innovations in that regard is…

Information Theory · Computer Science 2022-09-07 Ahmed Hareedy , Simeng Zheng , Paul Siegel , Robert Calderbank

In recent years, the CNN architectures designed by evolution algorithms have proven to be competitive with handcrafted architectures designed by experts. However, these algorithms need a lot of computational power, which is beyond the…

Computer Vision and Pattern Recognition · Computer Science 2023-05-08 Ousmane Youme , Jean Marie Dembele , Eugene C. Ezin , Christophe Cambier

Maximum run-length limited codes are constraint codes used in communication and data storage systems. Insertion/deletion correcting codes correct insertion or deletion errors caused in transmitted sequences and are used for combating…

Information Theory · Computer Science 2020-12-29 Reona Takemoto , Takayuki Nozaki

For $q$-ary $n$-sequences, we develop the concept of similarity functions that can be used (for $q=4$) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence…

Information Theory · Computer Science 2014-01-30 A. Dyachkov

DNA storage technology offers new possibilities for addressing massive data storage due to its high storage density, long-term preservation, low maintenance cost, and compact size. To improve the reliability of stored information, base…

Machine Learning · Computer Science 2024-09-24 Bowen Liu , Jiankun Li

The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the…

Information Theory · Computer Science 2025-07-29 Matteo Bertuzzo , Alberto Ravagnani , Eitan Yaakobi

Functions of chemical composition are complex and discrete in nature making it impossible to optimize them with gradient methods. Genetic algorithms, which do not use derivative information, are used to maximize the thermal conductivity of…

Materials Science · Physics 2018-01-30 Alexander Kerr , Kieran Mullen

The nucleotide sequence representation of DNA can be inadequate for resolving protein-DNA binding sites and regulatory substrates, such as those involved in gene expression and horizontal gene transfer. Considering that sequence-like…

Genomics · Quantitative Biology 2020-07-30 Jan Zrimec

Digital information can be encoded in the building-block sequence of macro-molecules, such as RNA and single-stranded DNA. Methods of "writing" and "reading" macromolecular strands are currently available, but they are slow and expensive.…

Emerging Technologies · Computer Science 2017-09-14 Masud Mansuripur , Pramod Khulbe

Constrained sequence (CS) codes, including fixed-length CS codes and variable-length CS codes, have been widely used in modern wireless communication and data storage systems. Sequences encoded with constrained sequence codes satisfy…

Information Theory · Computer Science 2019-06-17 Congzhe Cao , Duanshun Li , Ivan Fair

The ability to store data in the DNA of a living organism has applications in a variety of areas including synthetic biology and watermarking of patented genetically-modified organisms. Data stored in this medium is subject to errors…

Information Theory · Computer Science 2016-11-17 Siddharth Jain , Farzad Farnoud , Moshe Schwartz , Jehoshua Bruck

This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running time as a function of input size for algorithms with time…

Discrete Mathematics · Computer Science 2007-05-23 Ronald I. Greenberg