Cover Image

Random Access Expectation in DNA Storage and Fountain Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hofmeister, Christoph, Bitar, Rawad, Yaakobi, Eitan
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Byzantine-Resilient Gradient Coding through Local Gradient Computations
by: Hofmeister, Christoph, et al.
Published: (2024)

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

Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
by: Jain, Shreyas, et al.
Published: (2024)

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

CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
by: Hofmeister, Christoph, et al.
Published: (2025)

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

Making it to First: The Random Access Problem in DNA Storage
by: Boruchovsky, Avital, et al.
Published: (2025)

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

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

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

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

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

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

Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning
by: Xia, Yue, et al.
Published: (2025)

Fundamental Limits of Decentralized Self-Regulating Random Walks
by: Khalesi, Ali, et al.
Published: (2026)

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

On the Extension of Private Distributed Matrix Multiplication Schemes to the Grid Partition
by: Hofmeister, Christoph, et al.
Published: (2026)

Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy Compromises
by: Xia, Yue, et al.
Published: (2024)

LoByITFL: Low Communication Secure and Private Federated Learning
by: Xia, Yue, et al.
Published: (2024)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

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

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)

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

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

Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
by: Walter, Frederik, et al.
Published: (2024)

Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
by: Bitar, Rawad, et al.
Published: (2018)

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

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

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

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)

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

Scalable and Reliable Over-the-Air Federated Edge Learning
by: Egger, Maximilian, et al.
Published: (2024)

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

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

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

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

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

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes
by: Ding, Yi, et al.
Published: (2024)