Back to Search
Start Over
Coding Over Sets for DNA Storage.
- Source :
- IEEE Transactions on Information Theory; Apr2020, Vol. 66 Issue 4, p2331-2351, 21p
- Publication Year :
- 2020
-
Abstract
- In this paper we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an unordered set of $M$ sequences, each of length $L$. Errors within that model are a loss of whole sequences and point errors inside the sequences, such as insertions, deletions and substitutions. We derive Gilbert-Varshamov lower bounds and sphere packing upper bounds on achievable cardinalities of error-correcting codes within this storage model. We further propose explicit code constructions than can correct errors in such a storage system that can be encoded and decoded efficiently. Comparing the sizes of these codes to the upper bounds, we show that many of the constructions are close to optimal. [ABSTRACT FROM AUTHOR]
- Subjects :
- ERROR-correcting codes
SPHERE packings
DNA
DATA warehousing
STORAGE
DNA synthesis
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 66
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 143315394
- Full Text :
- https://doi.org/10.1109/TIT.2019.2961265