:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Kok Hao, Dao, Duc Tu, Kiah, Han Mao, Pham, Van Long Phuoc, Yaakobi, Eitan
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2405.06870
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
by: Singhvi, Shubhransh, et al.
Published: (2026)

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

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024)

Private Repair of a Single Erasure in Reed-Solomon Codes
by: Kruglik, Stanislav, et al.
Published: (2024)

Coding for Synthesis Defects
by: Lu, Ziyang, et al.
Published: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

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

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

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

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

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

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

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

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics
by: Keshav, Goyal, et al.
Published: (2023)

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

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

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

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

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

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

The Capacity of the Weighted Read Channel
by: Yerushalmi, Omer, 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)

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)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

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

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

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
by: Abraham, Hadas, 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)

Function-Correcting Codes for b-Symbol Read Channels
by: Singh, Anamika, et al.
Published: (2025)

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

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

Sequence Reconstruction over Coloring Channels for Protein Identification
by: Bariffi, Jessica, et al.
Published: (2025)

Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection
by: Kim, Wilton, et al.
Published: (2025)

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

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

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

Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
by: Zhang, Wenqin, et al.
Published: (2025)

Decoding Insertions/Deletions via List Recovery
by: Banerjee, Anisha, et al.
Published: (2025)