Properties and Constructions of Constrained Codes for DNA-Based Data Storage
Properties and Constructions of Constrained Codes for DNA-Based Data Storage
复制标题
DOI：
10.1109/access.2020.2980036
复制
发表时间：
2020-01-01
期刊：
影响因子：
3.9
通讯作者：
Cai, Kui
中科院分区：
文献类型：
--
作者：
Immink, Kees A. Schouhamer;Cai, Kui
描述了基于DNA的数据存储中考虑最大重复长度和AT/GC平衡的基于约束的代码的性质和构造。给出了计算具有最大重复长度和AT/GC平衡约束的序列个数的母函数和近似公式。我们描述了将二进制游程长度受限和/或平衡的字符串转换为DNA链的例程，并计算了这些例程的效率。推导了同时考虑最大重复长度和AT/GC平衡的码的冗余度表达式。
We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.