Pith. sign in

REVIEW 1 cited by

Error Correction for DNA Storage

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.01729 v1 pith:QLIUZJ3N submitted 2023-10-03 cs.IT math.IT

Jin Sima , Netanel Raviv , Moshe Schwartz , Jehoshua Bruck This is my paper · ORCID
classification cs.ITmath.IT
keywords storagecodeschallengescodingcorrectingcorrectiondna-basederror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes, error correction in DNA storage poses several interesting coding theoretic challenges, some of which are new. In this paper, we give a brief introduction to some of the coding challenges for DNA-based storage, including deletion/insertion correcting codes, codes over sliced channels, and duplication correcting codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Identification Over Noisy Permutation Channels

    cs.IT 2024-12 conditional novelty 6.0 of 10

    Identification capacity of the q-ary noisy permutation channel is (q-1)/2 for full-rank strictly positive noise, with matching achievability and strong converse up to log factors.

Pith tools