期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 63, 期 8, 页码 4982-4995出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2017.2700847
关键词
Coding for DNA-based storage; Delsarte linear programming bounds; Lee distance
资金
- NSF STC Class [CCF 0939370]
- University of Illinois, Urbana-Champaign
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据