DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel

2025/01/25 by Adir Kobovich, Kobovich, Adir, Eitan Yaakobi +3 · 1 voice · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Algorithms and Data Compression

paper · pdf · doi:10.48550/arxiv.2501.15172

Abstract

We address the challenge of optimizing the capacity-achieving input distribution for a multinomial channel under the constraint of limited input support size, which is a crucial aspect in the design of DNA storage systems. We propose an algorithm that further elaborates the Multidimensional Dynamic Assignment Blahut-Arimoto (M-DAB) algorithm. Our proposed algorithm integrates variational autoencoder for determining the optimal locations of input distribution, into the alternating optimization of the input distribution locations and weights.

Cited by

• Secret Sharing for DNA Probability Vectors

Discussions

• crucial aspect in the design of DNA storage systems. We propose an algorithm that further elaborates the Multidimensional Dynamic Assignment Blahut-Arimoto (M-DAB) algorithm. Our proposed algorithm in [bsky, 1 points, 1 comments]

Related

• Covering All Bases: The Next Inning in DNA Sequencing Efficiency
• Disturbance-based Discretization, Differentiable IDS Channel, and an IDS-Correcting Code for DNA-based Storage
• Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel
• Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
• Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel