Cover Image

Making it to First: The Random Access Problem in DNA Storage

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Boruchovsky, Avital, Elishco, Ohad, Gabrys, Ryan, Gruica, Anina, Tamo, Itzhak, Yaakobi, Eitan
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Serving Every Symbol: All-Symbol PIR and Batch Codes
by: Boruchovsky, Avital, et al.
Published: (2026)

A Combinatorial Perspective on Random Access Efficiency for DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
by: Boruchovsky, Avital, et al.
Published: (2023)

Coding for Ordered Composite DNA Sequences
by: Dollma, Besart, et al.
Published: (2025)

The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

Permutation Recovery Problem against Deletion Errors for DNA Data Storage
by: Singhvi, Shubhransh, et al.
Published: (2024)

Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs
by: Hofmeister, Christoph, et al.
Published: (2024)

Random Access in DNA Storage: Algorithms, Constructions, and Bounds
by: Wang, Chen, et al.
Published: (2026)

Complex DNA Synthesis Sequences
by: Moav, Boaz, et al.
Published: (2025)

Random Access Expectation in DNA Storage and Fountain Codes
by: Hofmeister, Christoph, et al.
Published: (2026)

Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes
by: Beelen, Peter, et al.
Published: (2025)

Covering All Bases: The Next Inning in DNA Sequencing Efficiency
by: Abraham, Hadas, et al.
Published: (2024)

One Code Fits All: Strong stuck-at codes for versatile memory encoding
by: Con, Roni, et al.
Published: (2024)

Efficient Synthesis for Two-Dimensional Strand Arrays with Row Constraints
by: Moav, Boaz, et al.
Published: (2026)

Tail-Erasure-Correcting Codes
by: Moav, Boaz, et al.
Published: (2024)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

On the Long-Term behavior of $k$-tuples Frequencies in Mutation Systems
by: Elishco, Ohad
Published: (2024)

Error-Correcting Codes for Combinatorial Composite DNA
by: Sabary, Omer, et al.
Published: (2024)

Correcting Tail Deletions in Rank Modulated Composite Encoding for Data Storage in DNA
by: Cohen, Tomer, et al.
Published: (2026)

Central Limit Theorem for Mutation Systems
by: Koram, Liav, et al.
Published: (2026)

Convertible Codes for Data and Device Heterogeneity
by: Gruica, Anina, et al.
Published: (2026)

Rank Modulated Composite Encoding for Data Storage in DNA
by: Cohen, Tomer, et al.
Published: (2026)

Error-Correcting Codes for Labeled DNA Sequences
by: Hanania, Dganit, et al.
Published: (2025)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)

DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2025)

Expected Recovery Time in DNA-based Distributed Storage Systems
by: Levy, Adi, et al.
Published: (2026)

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2023)

On Nearly Perfect Covering Codes
by: Boruchovsky, Avital, et al.
Published: (2024)

Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning
by: Bar-Lev, Daniella, et al.
Published: (2021)

Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
by: Cohen, Tomer, et al.
Published: (2025)

Studying the Cycle Complexity of DNA Synthesis
by: Zrihan, Amit, et al.
Published: (2024)

Algebraic Expander Codes
by: Kopparty, Swastik, et al.
Published: (2026)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
by: Berend, Hagai, et al.
Published: (2025)

Insertion and Deletion Correction in Polymer-based Data Storage
by: Banerjee, Anisha, et al.
Published: (2022)

General Coverage Models: Structure, Monotonicity, and Shotgun Sequencing
by: Grunbaum, Yitzchak, et al.
Published: (2025)

Error-Correcting Codes for the Sum Channel
by: Abboud, Lyan, et al.
Published: (2026)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)