Search arXivSearch

arXiv · 2602.11951

Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors

Abstract

DNA data storage offers a high-density, long-term alternative to conventional storage systems, addressing the exponential growth of digital data. Composite DNA extends this paradigm by leveraging mixtures of nucleotides to increase storage capacity beyond the four standard bases. In this work, composite DNA storage is modeled as a multinomial channel, and an analogy to digital modulation is established by representing composite letters on the three-dimensional probability simplex. To mitigate errors caused by sampling randomness, we derive transition probabilities for each constellation point which enables the computation of bit-wise log-likelihood ratios (LLRs) to employ practical channel codes for error correction. The framework is then extended to substitution and insertion-deletion-substitution (IDS) channels by proposing constellation update rules that account for these impairments. For the substitution channel, exact constellation updates enable exact LLR computation. In contrast, for the IDS channel, the large number of possible cases necessitates an approximate update rule, yielding approximate LLRs. To address this limitation, we further propose two learning-enhanced receiver architectures: (1) RhoNet, a learning-assisted model-based method that refines constellation points prior to analytical LLR computation, and (2) LLRNet, which directly estimates LLRs, representing a progressive transition from model-based analytical estimation to fully data-driven processing. Numerical results demonstrate reliable performance with existing low-density parity-check (LDPC) codes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Busra Tegin, Tolga M Duman. 2026-09-08. Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors. https://arxiv.org/abs/2602.11951

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT