Improved Coding over Sets for DNA-Based Data Storage
Hengjia Wei, Moshe Schwartz
TL;DR
This paper advances DNA-based data storage by developing improved error-correcting codes over sets, providing new bounds and constructions that enhance reliability in the presence of diverse errors.
Contribution
It introduces novel bounds and code constructions for error correction in DNA storage channels, improving upon existing methods.
Findings
New bounds on code parameters are established.
Constructed codes often match bounds up to small factors.
Enhanced error correction capabilities for DNA storage channels.
Abstract
Error-correcting codes over sets, with applications to DNA storage, are studied. The DNA-storage channel receives a set of sequences, and produces a corrupted version of the set, including sequence loss, symbol substitution, symbol insertion/deletion, and limited-magnitude errors in symbols. Various parameter regimes are studied. New bounds on code parameters are provided, which improve upon known bounds. New codes are constructed, at times matching the bounds up to lower-or der terms or small constant factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Advanced biosensing and bioanalysis techniques · Cellular Automata and Applications