English
Related papers

Related papers: Insertion and Deletion Correction in Polymer-based…

200 papers

Machine-learning (ML) models in polymer science typically treat a polymer as a single, perfectly defined molecular graph, even though real materials consist of stochastic ensembles of chains with distributed lengths. This mismatch between…

Machine Learning · Computer Science 2025-12-16 Khalid Ferji

We present a construction of subspace codes along with an efficient algorithm for list decoding from both insertions and deletions, handling an information-theoretically maximum fraction of these with polynomially small rate. Our…

Information Theory · Computer Science 2012-02-03 Venkatesan Guruswami , Srivatsan Narayanan , Carol Wang

One requirement of maintaining digital information is storage. With the latest advances in the digital world, new emerging media types have required even more storage space to be kept than before. In fact, in many cases it is required to…

Data Structures and Algorithms · Computer Science 2025-01-22 Vasileios Alevizos , Nikitas Gerolimos , Sabrina Edralin , Clark Xu , Akebu Simasiku , Georgios Priniotakis , George Papakostas , Zongliang Yue

In distributed storage systems that employ erasure coding, the issue of minimizing the total {\it repair bandwidth} required to exactly regenerate a storage node after a failure arises. This repair bandwidth depends on the structure of the…

Information Theory · Computer Science 2011-06-10 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

Two decades ago, a breakthrough in indexing string collections made it possible to represent them within their compressed space while at the same time offering indexed search functionalities. As this new technology permeated through…

Data Structures and Algorithms · Computer Science 2022-11-28 Gonzalo Navarro

DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction…

Information Theory · Computer Science 2019-09-10 Yonatan Yehezkeally , Moshe Schwartz

Data deduplication saves storage space by identifying and removing repeats in the data stream. Compared with traditional compression methods, data deduplication schemes are more time efficient and are thus widely used in large scale storage…

Information Theory · Computer Science 2022-05-30 Hao Lou , Farzad Farnoud

Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we…

Numerical Analysis · Mathematics 2014-10-21 Martin D. Schatz , Tze Meng Low , Robert A. van de Geijn , Tamara G. Kolda

Synthetic polymeric materials underpin fundamental technologies in the energy, electronics, consumer goods, and medical sectors, yet their development still suffers from prolonged design timelines. Although polymer informatics tools have…

Computational Engineering, Finance, and Science · Computer Science 2025-06-12 Ayush Jain , Rampi Ramprasad

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

Combinatorics · Mathematics 2016-05-18 Brandon Dutra

DNA data storage offers a high-density, long-term alternative to traditional storage systems, addressing the exponential growth of digital data. Composite DNA extends this paradigm by leveraging mixtures of nucleotides to increase storage…

Information Theory · Computer Science 2026-02-13 Busra Tegin , Tolga M Duman

We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing techniques and applications in DNA-based storage systems,…

Information Theory · Computer Science 2024-03-27 Yonatan Yehezkeally , Nikita Polyanskii

In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the…

Information Theory · Computer Science 2018-01-01 Kaveh Mahdaviani , Soheil Mohajer , Ashish Khisti

Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…

Discrete Mathematics · Computer Science 2014-03-12 Jayadev Acharya , Hirakendu Das , Olgica Milenkovic , Alon Orlitsky , Shengjun Pan

This paper studies the problem of encoding messages into sequences which can be uniquely recovered from some noisy observations about their substrings. The observed reads comprise consecutive substrings with some given minimum overlap. This…

Information Theory · Computer Science 2023-12-11 Hengjia Wei , Moshe Schwartz , Gennian Ge

We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by…

Information Theory · Computer Science 2016-11-18 Ian Holmes

We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage systems utilizing mass spectrometry. Namely, we see strings as…

Combinatorics · Mathematics 2025-04-02 Antoine Dailly , Tuomo Lehtilä

Three-dimensional (3D) printing's accessibility enables rapid manufacturing but also poses security risks, such as the unauthorized production of untraceable firearms and prohibited items. To ensure traceability and accountability,…

Information Theory · Computer Science 2025-08-07 Junsheng Liu , Netanel Raviv

Already in the 1960s, Levenshtein and others studied error-correcting codes that protect against synchronization errors, such as symbol insertions and deletions. However, despite significant efforts, progress on designing such codes has…

Information Theory · Computer Science 2021-01-05 Bernhard Haeupler , Amirbehshad Shahrasbi

This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction problem for polynomials from erroneous residues when the degrees of all residue errors are assumed small, namely…

Information Theory · Computer Science 2015-01-05 Li Xiao , Xiang-Gen Xia