Construction of single-deletion-correcting DNA codes using CIS codes

被引：2

作者：

Choi, Whan-Hyuk ^{[1
]}

Kim, Hyun Jin ^{[2
]}

Lee, Yoonjin ^{[3
]}

机构：

[1] Sogang Univ, Dept Math, Seoul 04107, South Korea

[2] Yonsei Univ, Univ Coll, 85 Songdogwahak Ro, Incheon 21983, South Korea

[3] Ewha Womans Univ, Dept Math, 11-1 Daehyun Dong, Seoul 03760, South Korea

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2020年 / 88卷 / 12期

基金：

新加坡国家研究基金会;

关键词：

DNA code; CIS code; Synchronization-correcting code; Deletion; Insertion; HAMMING DISTANCE; GC-CONTENT;

D O I：

10.1007/s10623-020-00802-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We find a method for constructing DNA codes with single-deletion-correcting capability. We first present an explicit algorithm for the construction of theq-ary single-deletion-correcting codes (abbreviated asSDC codes) using a class of the complementary information set codes (abbreviated asCIS codes), whereqis a power of a prime. We then show that the encoding/decoding scheme of the CIS codes with single-deletion-correcting capability has a simple deterministic algorithm. Finally, applying our algorithm to the generated DNA codes with appropriate modification, we obtain the DNA codes with single-deletion-correcting capability. We present some various examples of such DNA codes, and we also obtain some lower bounds on the maximum size of the single-deletion-correcting DNA codes.

引用

页码：2581 / 2596

页数：16

共 50 条

[21] Restricted Composition Deletion Correcting Codes
Cullina, Daniel
Kiyavash, Negar
Kulkarni, Ankur A.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (09) : 4819 - 4832
[22] On multiple insertion/deletion correcting codes
Helberg, ASJ
Ferreira, HC
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) : 305 - 308
[23] CODES CORRECTING A SINGLE INSERTION DELETION OF A ZERO OR A SINGLE PEAK-SHIFT
KLOVE, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (01) : 279 - 283
[24] Permutation Codes Correcting a Single Burst Deletion II: Stable Deletions
Chee, Yeow Meng
Ling, San
Tuan Thanh Nguyen
Van Khu Vu
Wei, Hengjia
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2688 - 2692
[25] Permutation Codes Correcting a Single Burst Deletion I: Unstable Deletions
Chee, Yeow Meng
Van Khu Vu
Zhang, Xiande
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1741 - 1745
[26] Formalization of VT Codes and Their Single-Deletion Correcting Property in Lean
Kondo, Yuki
Hagiwara, Manabu
Kudo, Midori
PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 597 - 601
[27] A Comparison Between Single Asymmetric and Single Insertion/Deletion Correcting Codes Using Group-Theory
Paluncic, Filip
Ferreira, Hendrik C.
Clarke, Willem A.
2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 135 - 138
[28] Optimal k-Deletion Correcting Codes
Sima, Jin
Bruck, Jehoshua
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 847 - 851
[29] Nonasymptotic Upper Bounds for Deletion Correcting Codes
Kulkarni, Ankur A.
Kiyavash, Negar
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (08) : 5115 - 5130
[30] An Algorithmic Approach for Finding Deletion Correcting Codes
Khajouei, Farzaneh
Zolghadr, Mahdy
Kiyavash, Negar
2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,

← 1 2 3 4 5 →