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 条

[1] Construction of single-deletion-correcting DNA codes using CIS codes
Whan-Hyuk Choi
Hyun Jin Kim
Yoonjin Lee
Designs, Codes and Cryptography, 2020, 88 : 2581 - 2596
[2] On single-deletion-correcting codes
Sloane, NJA
CODES AND DESIGNS, 2002, 10 : 273 - 291
[3] Single-Deletion-Correcting Codes over Permutations
Gabrys, Ryan
Yaakobi, Eitan
Farnoud, Farzad
Sala, Frederic
Bruck, Jehoshua
Dolecek, Lara
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2764 - 2768
[4] Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes
Dongvu Tonien
Reihaneh Safavi-Naini
Designs, Codes and Cryptography, 2007, 42 : 227 - 237
[5] Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
Tonien, Dongvu
Safavi-Naini, Reihaneh
DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (02) : 227 - 237
[6] Bounded Single Insertion/Deletion Correcting Codes
Nozaki, Takayuki
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2379 - 2383
[7] NONBINARY CODES, CORRECTING SINGLE DELETION OR INSERTION
TENENGOLTS, G
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (05) : 766 - 769
[8] On the construction of perfect deletion-correcting codes using design theory
Bours, Patrick A.H.
Designs, Codes, and Cryptography, 1995, 6 (01):
[9] A Combinatorial Construction for Perfect Deletion-Correcting Codes
Jianxing Yin
Designs, Codes and Cryptography, 2001, 23 : 99 - 110
[10] A combinatorial construction for perfect deletion-correcting codes
Yin, JX
DESIGNS CODES AND CRYPTOGRAPHY, 2001, 23 (01) : 99 - 110

← 1 2 3 4 5 →