Interleaved Constrained Codes With Markers Correcting Bursts of Insertions or Deletions

被引：6

作者：

Smith, Dylan ^{[1
]}

Swart, Theo G. ^{[1
]}

Abdel-Ghaffar, Khaled A. S. ^{[2
]}

Ferreira, Hendrik C. ^{[1
]}

Cheng, Ling ^{[3
]}

机构：

[1] Univ Johannesburg, Dept Elect & Elect Engn Sci, ZA-2006 Auckland Pk, South Africa

[2] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA

[3] Univ Witwatersrand, Sch Elect & Informat Engn, ZA-2050 Johannesburg, South Africa

来源：

IEEE COMMUNICATIONS LETTERS | 2017年 / 21卷 / 04期

关键词：

Insertions and deletions; burst error correction; constrained codes; Manchester code; markers; Knuth balancing scheme;

D O I：

10.1109/LCOMM.2017.2649492

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We present the construction of interleaving arrays for correcting clusters as well as diffuse bursts of insertion or deletion errors in constrained data. In this construction, a constrained information sequence is systematically encoded by computing a small number of parity checks and inserting markers such that the resulting code word is also constrained. Insertions and deletions lead to a shift between successive markers, which can thus be detected and recovered using the parity checks. In this letter, as an example, the scheme is developed for Manchester-encoded information sequences.

引用

页码：702 / 705

页数：4

共 50 条

[1] Codes Correcting a Burst of Deletions or Insertions
Schoeny, Clayton
Wachter-Zeh, Antonia
Gabrys, Ryan
Yaakobi, Eitan
[J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 630 - 634
[2] Codes Correcting a Burst of Deletions or Insertions
Schoeny, Clayton
Wachter-Zeh, Antonia
Gabrys, Ryan
Yaakobi, Eitan
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (04) : 1971 - 1985
[3] On correcting bursts of insertions, deletions and reversal errors
Ferreira, HC
Vinck, AJH
[J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 195 - 195
[4] Improved bounds for codes correcting insertions and deletions
Yasunaga, Kenji
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (05) : 1267 - 1278
[5] Improved bounds for codes correcting insertions and deletions
Kenji Yasunaga
[J]. Designs, Codes and Cryptography, 2024, 92 : 1267 - 1278
[6] EFFICIENT LINEAR AND AFFINE CODES FOR CORRECTING INSERTIONS/DELETIONS
Cheng, Kuan
Guruswami, Venkatesan
Haeupler, Bernhard
Li, Xin
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 748 - 778
[7] Asymptotically good codes correcting insertions, deletions, and transpositions
Schulman, LJ
Zuckerman, D
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2552 - 2557
[8] Rate Efficient Codes Correcting a Burst of Deletions or Insertions
Yi, Chen
Han, Xuesong
Li, Yong
Zhou, Jihua
He, Jiguang
Li, Chunguo
[J]. IEEE COMMUNICATIONS LETTERS, 2024, 28 (06) : 1253 - 1257
[9] Asymptotically good codes correcting insertions, deletions, and transpositions
Schulman, LJ
Zuckerman, D
[J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 669 - 674
[10] Codes for Correcting Three or More Adjacent Deletions or Insertions
Cheng, Ling
Swart, Theo G.
Ferreira, Hendrik C.
Abdel-Ghaffar, Khaled A. S.
[J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1246 - 1250

← 1 2 3 4 5 →