Codes for Correcting Three or More Adjacent Deletions or Insertions

被引：0
|
作者：
Cheng, Ling [1 ]
Swart, Theo G. [1 ]
Ferreira, Hendrik C. [1 ]
Abdel-Ghaffar, Khaled A. S. [1 ]
机构：
[1] Univ Witwatersrand, Johannesburg, South Africa
来源：
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2014年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Codes are presented that can correct the deletion or the insertion of a predetermined number of adjacent bits greater than or equal to three. This extends the constructions of codes beyond those proposed by Levenshtein fifty years ago to correct one or two adjacent deletions or insertions.
引用
收藏
页码：1246 / 1250
页数：5
相关论文
共 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] Improved bounds for codes correcting insertions and deletions
    Yasunaga, Kenji
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (05) : 1267 - 1278
  • [4] Improved bounds for codes correcting insertions and deletions
    Kenji Yasunaga
    [J]. Designs, Codes and Cryptography, 2024, 92 : 1267 - 1278
  • [5] 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
  • [6] 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
  • [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] 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
  • [9] Interleaved Constrained Codes With Markers Correcting Bursts of Insertions or Deletions
    Smith, Dylan
    Swart, Theo G.
    Abdel-Ghaffar, Khaled A. S.
    Ferreira, Hendrik C.
    Cheng, Ling
    [J]. IEEE COMMUNICATIONS LETTERS, 2017, 21 (04) : 702 - 705
  • [10] Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions
    Zhao, Peng
    Mu, Jianjun
    Jiao, Xiaopeng
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (10): : 2176 - 2179
12345