Abstract
We introduce a new family of codes, termed asymmetric Lee distance (ALD) codes, designed to correct errors arising in DNA-based storage systems and systems with parallel string transmission protocols. ALD codes are defined over a quaternary alphabet and analyzed in this particular setting, but the derived results hold for other alphabet sizes as well. Our technical contributions are twofold. First, we derive upper bounds on the size of the codes under the ALD metric based on linear programming techniques. Second, we propose a number of code constructions, which imply lower bounds.
| Original language | English (US) |
|---|---|
| Article number | 7918539 |
| Pages (from-to) | 4982-4995 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 63 |
| Issue number | 8 |
| DOIs | |
| State | Published - Aug 2017 |
Keywords
- Coding for DNA-based storage
- Delsarte linear programming bounds
- Lee distance
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences