Permutation Recovery Problem against Deletion Errors for DNA Data Storage
Fuente:
arXiv
Saved in:
| Main Authors: | Singhvi, Shubhransh, Gupta, Charchit, Boruchovsky, Avital, Goldberg, Yuval, Kiah, Han Mao, Yaakobi, Eitan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| 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)
by: Singhvi, Shubhransh, et al.
Published: (2026)
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024)
by: Singhvi, Shubhransh, et al.
Published: (2024)
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
by: Boruchovsky, Avital, et al.
Published: (2023)
by: Boruchovsky, Avital, et al.
Published: (2023)
Conditional Entropies of k-Deletion/Insertion Channels
by: Singhvi, Shubhransh, et al.
Published: (2024)
by: Singhvi, Shubhransh, et al.
Published: (2024)
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
by: Singhvi, Shubhransh
Published: (2024)
by: Singhvi, Shubhransh
Published: (2024)
Making it to First: The Random Access Problem in DNA Storage
by: Boruchovsky, Avital, et al.
Published: (2025)
by: Boruchovsky, Avital, et al.
Published: (2025)
Expected Recovery Time in DNA-based Distributed Storage Systems
by: Levy, Adi, et al.
Published: (2026)
by: Levy, Adi, et al.
Published: (2026)
Serving Every Symbol: All-Symbol PIR and Batch Codes
by: Boruchovsky, Avital, et al.
Published: (2026)
by: Boruchovsky, Avital, et al.
Published: (2026)
Correcting Tail Deletions in Rank Modulated Composite Encoding for Data Storage in DNA
by: Cohen, Tomer, et al.
Published: (2026)
by: Cohen, Tomer, et al.
Published: (2026)
Insertion and Deletion Correction in Polymer-based Data Storage
by: Banerjee, Anisha, et al.
Published: (2022)
by: Banerjee, Anisha, et al.
Published: (2022)
Error-Correcting Codes for Labeled DNA Sequences
by: Hanania, Dganit, et al.
Published: (2025)
by: Hanania, Dganit, et al.
Published: (2025)
Random Access in DNA Storage: Algorithms, Constructions, and Bounds
by: Wang, Chen, et al.
Published: (2026)
by: Wang, Chen, et al.
Published: (2026)
The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)
by: Bertuzzo, Matteo, et al.
Published: (2025)
Decoding Insertions/Deletions via List Recovery
by: Banerjee, Anisha, et al.
Published: (2025)
by: Banerjee, Anisha, et al.
Published: (2025)
Private Repair of a Single Erasure in Reed-Solomon Codes
by: Kruglik, Stanislav, et al.
Published: (2024)
by: Kruglik, Stanislav, et al.
Published: (2024)
Rank Modulated Composite Encoding for Data Storage in DNA
by: Cohen, Tomer, et al.
Published: (2026)
by: Cohen, Tomer, et al.
Published: (2026)
Random Access Expectation in DNA Storage and Fountain Codes
by: Hofmeister, Christoph, et al.
Published: (2026)
by: Hofmeister, Christoph, et al.
Published: (2026)
Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
by: Walter, Frederik, et al.
Published: (2024)
by: Walter, Frederik, et al.
Published: (2024)
On The Decoding Error Weight of One or Two Deletion Channels
by: Sabary, Omer, et al.
Published: (2022)
by: Sabary, Omer, et al.
Published: (2022)
Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)
by: Gross, Roee, et al.
Published: (2025)
Coding for Synthesis Defects
by: Lu, Ziyang, et al.
Published: (2024)
by: Lu, Ziyang, et al.
Published: (2024)
Error-Correcting Codes for the Sum Channel
by: Abboud, Lyan, et al.
Published: (2026)
by: Abboud, Lyan, et al.
Published: (2026)
The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)
by: Bertuzzo, Matteo, et al.
Published: (2026)
DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2025)
by: Kobovich, Adir, et al.
Published: (2025)
Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime
by: Chopra, Saransh, et al.
Published: (2026)
by: Chopra, Saransh, et al.
Published: (2026)
Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)
by: Singhvi, Shubhransh, et al.
Published: (2025)
M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2023)
by: Kobovich, Adir, et al.
Published: (2023)
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
by: Gruica, Anina, et al.
Published: (2024)
by: Gruica, Anina, et al.
Published: (2024)
On Nearly Perfect Covering Codes
by: Boruchovsky, Avital, et al.
Published: (2024)
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)
by: Bar-Lev, Daniella, et al.
Published: (2021)
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics
by: Chen, Kok Hao, et al.
Published: (2024)
by: Chen, Kok Hao, et al.
Published: (2024)
Complex DNA Synthesis Sequences
by: Moav, Boaz, et al.
Published: (2025)
by: Moav, Boaz, et al.
Published: (2025)
Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
by: Cohen, Tomer, et al.
Published: (2025)
by: Cohen, Tomer, et al.
Published: (2025)
Studying the Cycle Complexity of DNA Synthesis
by: Zrihan, Amit, et al.
Published: (2024)
by: Zrihan, Amit, et al.
Published: (2024)
Coding for Ordered Composite DNA Sequences
by: Dollma, Besart, et al.
Published: (2025)
by: Dollma, Besart, et al.
Published: (2025)
Error-Correcting Codes for Combinatorial Composite DNA
by: Sabary, Omer, et al.
Published: (2024)
by: Sabary, Omer, et al.
Published: (2024)
Correcting a Single Deletion in Reads from a Nanopore Sequencer
by: Banerjee, Anisha, et al.
Published: (2024)
by: Banerjee, Anisha, et al.
Published: (2024)
Covering All Bases: The Next Inning in DNA Sequencing Efficiency
by: Abraham, Hadas, et al.
Published: (2024)
by: Abraham, Hadas, et al.
Published: (2024)
Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)
by: Wang, Chen, et al.
Published: (2026)
Peak Age of Information under Tandem of Queues
by: Sinha, Ashirwad, et al.
Published: (2024)
by: Sinha, Ashirwad, et al.
Published: (2024)
Similar Items
-
Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
by: Singhvi, Shubhransh, et al.
Published: (2026) -
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024) -
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
by: Boruchovsky, Avital, et al.
Published: (2023) -
Conditional Entropies of k-Deletion/Insertion Channels
by: Singhvi, Shubhransh, et al.
Published: (2024) -
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
by: Singhvi, Shubhransh
Published: (2024)